逆序对的数量(归并排序模板)

题目链接：https://www.acwing.com/problem/content/790/
归并排序详解：https://blog.csdn.net/weixin_45758110/article/details/109252365

思路：在二路归并的过程中，如果出现a[i]>a[j],则sum+=mid-i+1(加上左边区间大于a[j]的个数)

#include<cstdio>
#include<iostream>
using namespace std;
const int maxn=1e5+5;
int a[maxn],tmp[maxn];
long long t=0;
void merge_sort(int a[], int l ,int r){
    if(l>=r)return ;
    int mid=l+r>>1;
    int k=0,i=l, j=mid+1;
    merge_sort(a,i,mid); merge_sort(a,mid+1,r);
    while(i<=mid&&j<=r){
        if(a[i]<=a[j])tmp[k++]=a[i++];
        else{
            tmp[k++]=a[j++];
            t+=mid-i+1;
        }
    }
    while(i<=mid)tmp[k++]=a[i++];
    while(j<=r) tmp[k++]=a[j++];
    for(i=l,j=0;i<=r;i++,j++)a[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);
    printf("%lld",t);
    return 0;
}