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

Re:树状数组解决逆序数O(n*lg(n))..

Posted by ymfoi at 2010-07-29 15:28:10 on Problem 3067 and last updated at 2010-07-29 15:34:12
In Reply To:树状数组解决逆序数O(n*lg(n)).. Posted by:luckyowen at 2009-05-22 16:51:01
准确的说是klogk
树状数组应该比归并慢一点..
归并是裸的klogk
树状是先klogk 再klogn

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