 |
| ||||
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: 我用nlogn过的 n2的dp能不能过？C++ 8k的存储时怎么做的？In Reply To: 我用nlogn过的 n2的dp能不能过？C++ 8k的存储时怎么做的？ Posted by:785815369 at 2010-07-13 12:17:54 O(n^2)可以过。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
