今天学cdq分治,原来归并排序求逆序对就是简单的cdq分治应用,顺便复习了归并排序,把归并排序模板敲一下,拿小本子记一下 ^_^,cdq牛逼!
#include<cstdio> #include<algorithm> using namespace std; const int maxn=1e5+5; int n,a[maxn],tmp[maxn]; void merge_sort(int l,int r){ if(l==r) return; int mid=(l+r)>>1; int t1=l,t2=mid+1,cnt=l; merge_sort(l,mid); merge_sort(mid+1,r); while(t1<=mid||t2<=r){ if(t2>r||(t1<=mid&&a[t1]<=a[t2])) tmp[cnt++]=a[t1++]; else tmp[cnt++]=a[t2++]; } for(int i=l;i<=r;++i) a[i]=tmp[i]; } int main(){ scanf("%d",&n); for(int i=1;i<=n;++i) scanf("%d",&a[i]); merge_sort(1,n); for(int i=1;i<=n;++i) printf("%d ",a[i]); printf("\n"); return 0; }