 |
| ||||
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 | |||||||||
好像是从左向右遍历一遍O(n)的，从左向右取和，一直维护最大值，当当前和小于0时，清零，不过就您的问题来讲，貌似排序就足够了In Reply To:Re:你误导别人了。这是很经典的设临时变量，非负则加负则舍弃的那种算法（求最大时） Posted by:Lop at 2005-09-12 13:04:44 > 谢谢,有点感觉了! > > 但 "非负则加负则舍弃" 有点不明白 > 烦请再解释一下,尤其你说这个 经典, 我也觉得,所以很想弄清楚,谢谢了! Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
