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 |
似乎NlogN的排序+N的遍历也不会慢一倍,78msIn Reply To:这题ON的算法反而慢ON2的快了一倍... Posted by:uni at 2005-04-13 10:23:45 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator