 |
| ||||
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:居然没超时，复杂度MS是 O(N ^0.33 * logN)的 Posted by:Sempr at 2006-03-14 23:19:04 可是我就是解方程啊，为什么TLE了？ Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
