HDU 4911Inversion(找逆序对)

题目链接

题记：归并排序的模板题。

#include<iostream>

using namespace std;
const int N=1e5+10;
typedef long long ll;
int q[N],tmp[N];
int n;

ll merge_sort(int l,int r){
    if(l>=r) return 0;
    int mid=l+r>>1;
    ll cnt=merge_sort(l,mid)+merge_sort(mid+1,r);
    int i=l,j=mid+1,k=0;
    while(i<=mid&&j<=r){
        if(q[i]<=q[j])
            tmp[k++]=q[i++];
        else {
            tmp[k++]=q[j++];
            cnt+=mid-i+1;
        }
    }
    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 cnt;
}

int main(){
    while(cin>>n){
        int k; cin>>k;
        for(int i=0;i<n;i++) cin>>q[i];
        ll ans=merge_sort(0,n-1)-k;
        if(ans<0) ans=0;
        cout<<ans<<endl;
    }
    return 0;
}