逆序对可能存在的3种情况:
//归并排序模板稍加一点改动
#include<iostream>
#include<cstdio>
using namespace std;
int q[100], tmp[100];
int res=0;
void merge_sort(int q[],int l,int r)
{
if (l>=r) return; //如果只有一个数字或没有数字,则无需排序
int mid=(l+r)/2;
merge_sort(q,l,mid); //排序左序列
merge_sort(q,mid+1,r); //右序列
int k=l,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;
}
}
while (i<=mid) tmp[k++] = q[i++]; //扫尾
while (j<=r) tmp[k++] = q[j++];
for (int i=l;i<=r;i++) q[i] = tmp[i];
}
int main()
{
int n;
cin >> n;
for (int i=0;i<n;i++)
{
cin>>q[i];
}
merge_sort(q,0,n-1);
cout<<res<<endl;
return 0;
}