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(nlogn)树状数组可以0msAC......In Reply To:大家有什么好办法,我只想出N平方的,跑了500多MS,不满意 Posted by:yesiam at 2005-02-06 11:39:04 Source Code Problem: 2182 User: ylllxw08 Memory: 260K Time: 0MS Language: C++ Result: Accepted Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator