Detail of message

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

居然没超时，复杂度MS是 O(N ^0.33 * logN)的

Posted by Sempr at 2006-03-14 23:19:04 on Problem 2100

Followed by:

要是这个复杂度能超时，都稀奇了 (0) sunmoonstar 2006-03-14 23:40:55
直接解方程可以去掉那个logN (0) frkstyc 2006-03-14 23:45:12
Re:居然没超时，复杂度MS是 O(N ^0.33 * logN)的 (18) 9990123 2006-10-16 16:14:38
- Re:居然没超时，复杂度MS是 O(N ^0.33 * logN)的 (19) Jaakques 2008-12-03 23:26:17
Re:居然没超时，复杂度MS是 O(N ^0.33 * logN)的 (0) chengangkk 2008-11-30 19:06:44

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator