 |
| ||||
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 | |||||||||
Re:2个o(n)的dp,1个o(n)的搜索水过，求教o(n)的算法In Reply To:Re:2个o(n)的dp,1个o(n)的搜索水过，求教o(n)的算法 Posted by:soarwind at 2009-11-11 13:34:27 > 不回溯找连续的几个元素最大和，有o(n)的算法，1050题也用到了 ....那个o(n)的搜索应该是最后一步判断max和的时候用的吧 前面那两个o(n)的dp才是求连续最大元素和的 一个正和 一个反和..... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
