 |
| ||||
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 | |||||||||
他那个的复杂度好像是O(nlg^2n)……In Reply To:让ghy大牛美观 简明 高效 复杂度仅为O(nlogn) 的程序都超时，这道题目出的太没有RP了 Posted by:zhougelin at 2006-03-27 15:25:52 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
