问题描述
解题过程:每个小朋友交换次数是前面比他大的个数与后面比他小的个数之和,主要思路是对数组归并两次,分别从左往右、然后再从右往左进行归并
1.要使用结构体记录原始数据的位置
2.要开两个数组各归并一遍,如果只开一个第一次归并不引用结果会出错
3.最终结果要开long long,不然结果会爆
4.最终结果要乘以 1LL(1的长整型),不然也会出错
代码如下:
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct Node
{
int id,v;
};
int cnt[100005];
void Merge_sort1(vector<Node>&vc,int l,int r)
{
if(l>=r-1) return;
int mid = (l+r)/2;
Merge_sort1(vc,l,mid);
Merge_sort1(vc,mid,r);
int i=l,j=mid,t=0;
Node *n = new Node[r-l];
while(i<mid || j<r)
{
if(j>=r || i<mid && vc[i].v<=vc[j].v)
n[t++] = vc[i++];
else
{
cnt[vc[j].id] += mid-i;
n[t++] = vc[j++];
}
}
t=0;
for(int k = l;k<r;k++)
vc[k] = n[t++];
delete []n;
}
void Merge_sort2(vector<Node>&vc,int l,int r)
{
if(l>=r-1) return;
int mid = (l+r)/2;
Merge_sort2(vc,l,mid);
Merge_sort2(vc,mid,r);
Node *n = new Node[r-l];
int i=mid-1,j=r-1,t=r-l-1;
while(i>=l || j>=mid)
{
if(i<l || j>=mid && vc[i].v <= vc[j].v)
n[t--] = vc[j--];
else
{
cnt[vc[i].id] += j-mid+1;
n[t--] = vc[i--];
}
}
t=0;
for(int i=l;i<r;i++)
vc[i] = n[t++];
delete []n;
}
int main()
{
int n;
cin >> n;
vector<Node> vc;
for(int i=0;i<n;i++)
{
Node node;
node.id = i;
cin >> node.v;
vc.push_back(node);
}
vector<Node> uc(vc.begin(),vc.end());
Merge_sort1(vc,0,vc.size());
Merge_sort2(uc,0,uc.size());
long long sum =0;
for(int i=0;i<vc.size();i++)
sum += 1ll*(1+cnt[i])*cnt[i]/2;
cout << sum;
return 0;
}