Detail of message

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

a segment tree will provide a O(logn) running time per operation

Posted by frkstyc at 2006-08-27 18:07:47 on Problem 2985
In Reply To:Colmplexity of the algorithm Posted by:8031987 at 2006-08-27 18:03:31

> I've used disjoint-set data structure with Fenwick's tree(to find k-th element in log^2(n)). But it taken TL.
> And what about your solution?

Followed by:

Re:a segment tree will provide a O(logn) running time per operation (182) 8031987 2006-08-27 18:29:08
- binary search tree is another option (188) frkstyc 2006-08-27 18:31:35

Post your reply here:

Home Page Go Back To top