原题题目
代码实现
#include<iostream>
using namespace std;
typedef long long LL;//1
const int N=100010;
int n;
int q[N],tmp[N];
LL merge_sort(int q[],int l,int r)//2
{
if(l>=r)return 0;
int mid=l+r>>1;
LL res=merge_sort(q,l,mid)+merge_sort(q,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
{
res+=mid-i+1;//3
tmp[k++]=q[j++];
}
}
while(i<=mid)tmp[k++]=q[i++];
while(j<=r)tmp[k++]=q[j++];
for(i=l,j=0;i<=r;i++,j++)q[i]=tmp[j];
return res;//4
}
int main()
{
cin >> n;
for(int i=0;i<n;i++)cin >> q[i];
cout << merge_sort(q,0,n-1)<<endl;//5
//for(int i=0;i<n;i++)cout << q[i] << ' ';
return 0;
}
改动
相比于母题,其实这一版本改动不大,无非就是加了三四句话,但是改动非常小,和原版本相似度百分之90;