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 |
呵呵 我的DP 貌似是O(N)的In Reply To:老实写的DP是O(N^2)肯定超时,如果仅仅是需要确定LIS长度有O(NlgN)的算法 Posted by:dirtysalt at 2009-07-30 19:02:35 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator