 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
动态规划In Reply To:大家讲一下这一题怎么做啊！！！我想了几天，都想不出什么的快捷的算法!!!拜托!!!!谢谢！！！ Posted by:acmgotogether at 2006-04-19 21:05:43 求最大子段和,从头到尾求一次,再从尾到头求一次,并在求的时候把每个位置的值记下来,最后找出和最大的位置 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
