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)的,还不如暴力In Reply To:树状数组也超时的,那菜鸟只能无语,收山回林娶老婆! Posted by:longniu at 2009-08-17 10:14:38 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator