 |
| ||||
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:树状数组解决逆序数O（n*lg(n)）..In Reply To:Re:树状数组解决逆序数O（n*lg(n)）.. Posted by:ymfoi at 2010-07-29 15:28:10 > 准确的说是klogk > 树状数组应该比归并慢一点.. > 归并是裸的klogk > 树状是先klogk 再klogn 呵呵~基数排序就没问题了，O（k）秒过 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
