 |
| ||||
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 | |||||||||
Never Give Up!It's great to overcome a puzzle, isn't it? I conquer this problem finally, I didn't give up! After several attempts,I want kill myself!Cause complexity is O(n^2lg(n)) or even lower O(n^2),but TLE is still a nightmare! Come on everybody! Be faithful and be strong!Stick to your hope!You will make it someday! Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
