蓝桥杯备考（倒计时五十四天）——逆序对的数量

#include<iostream>
#include<cstdio>

using namespace std;

typedef long long LL;
const int N=100010;
int q[N],tmp[N];

LL merge_sort(int l,int r)
{
    if(l>=r) return 0;
    
    int mid=(l+r)/2;
    
    LL res=merge_sort(l,mid)+merge_sort(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++];
            res+=mid-i+1;//排好序后，下标小于i的都小于q[j]
        }
    //扫尾    
    while(i<=mid) tmp[k++]=q[i++];
    while(j<=r)   tmp[k++]=q[j++];
    //物归原主
    for(int i=l,j=0;i<=r;i++,j++) q[i]=tmp[j];
    
    return res;
}
int main()
{
    int n;
    scanf("%d",&n);
    
    for(int i=0;i<n;i++) scanf("%d",&q[i]);
    
    printf("%lld",merge_sort(0,n-1));
    
    return 0;
}