 |
| ||||
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 | |||||||||
导论上有个习题就是求逆序对，类似MergeSort，复杂度O(NlogN)，写起来也很方便In Reply To:Re:逆序对怎么求？Re:I 线段处理 Posted by:atlas_of_rruucc at 2004-09-14 00:22:08 > www.ioiforum.org的OIBH上有专门的论文介绍这个东西，找来看看吧 > 不然线段树也可以，随便一本计算几何的教材上都有 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
