逆序对的数量（归并算法）

#include <iostream>
using namespace std;
const int N=100010;
int q[N],tem[N];
int sum=0;
void  part(int l,int r,int q[]){
	if(l>=r)return;
	
    int mid=(l+r)>>1;
    part(l,mid,q);
    part(mid+1,r,q);
    int i=l,j=mid+1,k=0;
    while(i<=mid &&j<=r){
        if(q[i]<=q[j])tem[k++]=q[i++];
        else 
        {
            sum=sum+(j-i);//这是原先错误的地方，下面有图解释
            tem[k++]=q[j++];
        }
    }  
    while(i<=mid)tem[k++]=q[i++];
    while(j<=r)tem[k++]=q[j++];
    for(i=0 ,j=l;j<=r;i++ ,j++){
            q[j]=tem[i];
    }
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&q[i]);
    }
   part(0,n-1,q);
    printf("%d\n",sum);
    for(int i=0;i<n;i++)printf("%d ",q[i]);
    return 0;
}

 但是当我们把sum=sum+（j-i）替换成sum=sum+(mid+1-i)就正确了，就可以避免这种情况的发生

#include <iostream>
using namespace std;
const int N=100010;
int q[N],tem[N];
long long int  sum=0;
void  part(int l,int r,int q[]){
	if(l>=r)return;
	
    int mid=(l+r)>>1;
    part(l,mid,q);
    part(mid+1,r,q);
    int i=l,j=mid+1,k=0;
    while(i<=mid &&j<=r){
        if(q[i]<=q[j])tem[k++]=q[i++];
        else 
        {
            sum=sum+(mid-i+1);
            tem[k++]=q[j++];
        }
    }  
    while(i<=mid)tem[k++]=q[i++];
    while(j<=r)tem[k++]=q[j++];
    for(i=0 ,j=l;j<=r;i++ ,j++){
            q[j]=tem[i];
    }
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&q[i]);
    }
   part(0,n-1,q);
    printf("%lld\n",sum);
    // for(int i=0;i<n;i++)printf("%d ",q[i]);
    return 0;
}