POJ_2299_Ultra-QuickSort(归并排序,逆序数)
摘要:
http://poj.org/problem?id=2299 1 # include 2 # include 3 # include 4 # include 5 using namespace std; 6 const int MAXN= 500005; 7 __int64 a[MAXN],b[MAXN]; 8 __int64 cnt; 9 void merge_sort(__int64 *a,int x,int y,__int64 *b)10 {11 __int64 mid,i,j,k;12 13 if(y>x+1)14 {15 __int64... 阅读全文
posted @ 2013-08-19 19:32 随风浪子的博客 阅读(106) 评论(0) 推荐(0) 编辑