 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
binary search tree is another optionIn Reply To:Re:a segment tree will provide a O(logn) running time per operation Posted by:8031987 at 2006-08-27 18:29:08 > Only segment tree must be used? > Some time ago I think that segment tree and Fenwick's tree provide search k-th element in O(log^2 n)... but for O(log n) I don't know how to do it... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
