HDU 4911

Description
bobo has a sequence a 1,a 2,…,a n. He is allowed to swap two adjacent numbers for no more than k times.

Find the minimum number of inversions after his swaps.

Note: The number of inversions is the number of pair (i,j) where 1≤i

求输入序列的逆序对

代码实现

#include <cstdio>
#include <iostream>
using namespace std;
#define MAXN 100005
long long a[MAXN];
long long b[MAXN];
long long cnt;
void Merge(long long l,long long m,long long r) //归并排序
{
     long i=l,j=m+1,t=0;
     while(i<=m&&j<=r)
     {
          if(a[i]>a[j])
          {
               b[t++]=a[j++];
               cnt+=m-i+1;
          }
          else
          {
               b[t++]=a[i++];
          }
     }
     while(i<=m)
          b[t++]=a[i++];
     while(j<=r)
          b[t++]=a[j++];
     for(long long i=0;i<t;i++)
     {
          a[l+i]=b[i];
     }
}
void Mergesort(long long  l,long long r)
{
    if(l<r)
    {
         long long  m=(l+r)/2;
         Mergesort(l,m);
         Mergesort(m+1,r);
         Merge(l,m,r);
    }
}
int main()
{
    long long n,k;

    while(scanf("%lld %lld",&n,&k)==2)
    {
        cnt=0;
        for(int i=0;i<n;i++){
            scanf("%lld",&a[i]);
        }
        Mergesort(0,n-1);
        if(cnt<=k)//判断cnt和k的值
            printf("0\n");
        else
            printf("%I64d\n",cnt-k);//输出控制符

    }

    return 0;
}