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 |
k段的话应该是时间O(k*n)空间O(k)的dp吧?In Reply To:最大子段和如果是N段(N >=3)而不是一段或者两段,应该怎么做? Posted by:achilles at 2005-07-17 10:22:03 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator