 |
| ||||
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:329MS 发篇blog庆祝一下 欢迎交流In Reply To:329MS 发篇blog庆祝一下 欢迎交流 Posted by:jlw686 at 2008-06-24 11:05:34 > http://hi.baidu.com/jlw686/blog/item/937851a21f65f7a8caefd002.html 这种方法当序列为递减序列是n^2的复杂度吧，不过这道题各种复杂度最坏情况为n^2的算法都比n*log(n)的快 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
