归并排序及求逆序对（算法模板）

归并排序：

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],tmp[N];
void merge_sort(int q[],int l,int r)
{
	if(l>=r)	return ;
	int mid =l+r>>1;
	merge_sort(q,l,mid);	merge_sort(q,mid+1,r);
	int k=0,i=l,j=mid+1;
	while(i<=mid&&j<=r)
		if(q[i]<=q[j])	tmp[k++]=q[i++];
		else	tmp[k++]=q[j++];
	while(i<=mid)	tmp[k++]=q[i++];
	while(j<=r)	tmp[k++]=q[j++];
	for(i=l,j=0;i<=r;i++,j++)	q[i]=tmp[j];
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)	scanf("%d",&a[i]);
	merge_sort(a,0,n-1);
	for(int i=0;i<n;i++)	printf("%d",a[i]);
	return 0;
} 

逆序对：

#include<bits/stdc++.h>
using namespace std;
int n,a[500010],c[500010];
long long ans;
void msort(int l,int r)
{
	if(l==r)	return ;
	int mid=l+r>>1,i=l,j=mid+1,k=l;
	msort(l,mid);	msort(mid+1,r);
	while(i<=mid&&j<=r)
		if(a[i]<=a[j])	c[k++]=a[i++];
		else{
			ans+=mid-i+1;
			c[k++]=a[j++];
		}
	while(i<=mid)	c[k++]=a[i++];
	while(j<=r)	c[k++]=a[j++];
	for(i=l;i<=r;i++)	a[i]=c[i];
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)	scanf("%d",&a[i]);
	msort(1,n);
	printf("%lld",ans);
}