 |
| ||||
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 | |||||||||
Re:a segment tree will provide a O(logn) running time per operationIn Reply To:a segment tree will provide a O(logn) running time per operation Posted by:frkstyc at 2006-08-27 18:07:47 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
