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 |
要是这个复杂度能超时,都稀奇了In Reply To:居然没超时,复杂度MS是 O(N ^0.33 * logN)的 Posted by:Sempr at 2006-03-14 23:19:04 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator