 |
| ||||
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:终于优化到O（n^2)过掉了In Reply To:O(n^2logn)的算法会ＴＬＥ？ Posted by:HeartRush at 2007-09-16 09:22:08 > 这个复杂度和Ｏ（ｎ＾２）相差不大吧 > 为什么会TLE呢 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
