P1908 逆序对（归并排序）C/C++

#include<iostream>
using namespace std;

long long int ans=0;

void merge_sort(int a[],int temp[],long long int left,long long int right)
{
    if(left==right){
        return;
    }

    long long int mid=(right+left)/2;
    long long int i1,i2,cur;
    merge_sort(a,temp,left,mid);
    merge_sort(a,temp,mid+1,right);

    for(long long int i=left;i<=right;i++)
    {
        temp[i]=a[i];
    }
    
    i1=left,i2=mid+1;
  
    for(cur=left;cur<=right;cur++)
    {
        if(i1>mid){
            a[cur]=temp[i2++];
        }
        else if(i2>right){
            a[cur]=temp[i1++];
        }
        else if(temp[i1]<=temp[i2]){
            a[cur]=temp[i1++];
        }
        else if(temp[i1]>temp[i2]){
            ans+=mid-i1+1;
            a[cur]=temp[i2++];
        }
    }
    return;
}

int main()
{
	long long int n;
	cin >> n ;
	int a[n+10]={0};
	int temp[n+10]={0};

    for(long long int i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    
    merge_sort(a,temp,1,n);
    
    cout << ans << endl ;
    return 0;
}