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

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:

Re:树状数组解决逆序数O（n*lg(n)）.. (85) xxyyttxx 2014-01-22 19:41:44

Post your reply here:

Home Page Go Back To top