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 |
用线段树吧,中间记录点东西,建树复杂度应该是n*logN,然后查询一次是logNIn Reply To:我也超时啊~,使用了折半查找,依然超时~ Posted by:derness at 2007-08-30 09:46:26 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator