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 |
一种非常BT的方法就是线段树嵌套平衡树,这样一次操作是(logn)^2的。。。In Reply To:这个题这样做都超时了,我就有点纳闷了。。。。。 Posted by:faen at 2005-05-20 15:12:12 > 就是用标准的partion,分治法。对于每一组数据,是O(logn)的。 > 我记得算法书上证明过,这是最快的方法了阿?? > 那些过了的大牛,把你们的算法说说呗 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator