 |
| ||||
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:居然没超时，复杂度MS是 O(N ^0.33 * logN)的In Reply To:Re:居然没超时，复杂度MS是 O(N ^0.33 * logN)的 Posted by:9990123 at 2006-10-16 16:14:38 复杂度n^0.33的是不会超的。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
