摘要： int a[MAXN];int N;int cnt = 0;void merge(int l,int m,int r);void merge_sort(int l,int r){ if ( l < r ) { int m = ( l + r ) >> 1; merge_sort(l,m); merge_sort(m + 1,r); merge(l,m,r); }}void merge(int l,int m,int r){ int n1 = m - l + 1; int n2 = r - m; int*... 阅读全文