2021牛客暑期多校训练营4-I题

I题：Inverse Pair

原题链接:https://ac.nowcoder.com/acm/contest/11255/I

题目大意

思路

首先考虑如何使逆序数对最小，贪心即可。$a_i$之前若出现过$a_k=a_i+1$则将$a_i$的值+1，将数组修改至逆序数对最小的情况。
数据范围是$1\le n\le 2\times 10^5$所以需要用到归并排序统计逆序数对。

代码实现

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+7;
int n,ans;
int a[N],tmp[N],v[N];
long long merge_sort(int l,int r){
    if(l>=r)return 0;
    int mid = l + r >> 1;
    long long res = merge_sort(l,mid)+merge_sort(mid+1,r);
    int k = 0,i = l,j = mid+1;
    while(i<=mid && j<=r){
        if(a[i]<=a[j]){
            tmp[k++] = a[i++];
        }else{
            res += mid-i+1;
            tmp[k++] = a[j++];
        }
    }
    while(i<=mid) tmp[k++] = a[i++];
    while(j<=r) tmp[k++] = a[j++];
    for(int i = l,j = 0;i<=r;i++,j++)
        a[i] = tmp[j];
    return res;
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
    for(int i=1;i<=n;i++){
        if(v[a[i]+1])a[i]++;
        else v[a[i]]=1;
    }
	printf("%lld\n",merge_sort(1,n));
	return 0;
}