Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

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:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator