hdu4911 Inversion(逆序对数)

题目：

Inversion

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2765    Accepted Submission(s): 1024

Problem Description

bobo has a sequence a ₁,a ₂,…,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<j≤n and a _i>a _j.

 

Input

The input consists of several tests. For each tests:

The first line contains 2 integers n,k (1≤n≤10 ⁵,0≤k≤10 ⁹). The second line contains n integers a ₁,a ₂,…,a _n (0≤a _i≤10 ⁹).

 

Output

For each tests:

A single integer denotes the minimum number of inversions.

 

Sample Input

  
  

   
   3 1
2 2 1
3 0
2 2 1
  
  

 

Sample Output

  
  

   
   1
2
  
  

 

Author

Xiaoxu Guo (ftiasch)

 

Source

2014 Multi-University Training Contest 5

 

题意：给一个序列，每次可以交换相邻的数字，问最多交换k次后能得到的最少的逆序对数是多少。

思路：每次交换都可以使逆序对数减一，所以最少的逆序对数就是max(cnt-k,0)，cnt为最开始的逆序对数。求最开始的逆序对数可以用归并的方法来求。

代码：

#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include<climits>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>
using namespace std;

#define PB push_back
#define MP make_pair

#define REP(i,x,n) for(int i=x;i<(n);++i)
#define FOR(i,l,h) for(int i=(l);i<=(h);++i)
#define FORD(i,h,l) for(int i=(h);i>=(l);--i)
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) int (X); scanf("%d", &X)
#define DRII(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define OI(X) printf("%d",X);
#define RS(X) scanf("%s", (X))
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
#define Swap(a, b) (a ^= b, b ^= a, a ^= b)
#define Dpoint  strcut node{int x,y}
#define cmpd int cmp(const int &a,const int &b){return a>b;}

 /*#ifdef HOME
    freopen("in.txt","r",stdin);
    #endif*/
const int MOD = 1e9+7;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef long long LL;
typedef pair<int,int> PII;
//#define HOME

int Scan()
{
	int res = 0, ch, flag = 0;

	if((ch = getchar()) == '-')				//判断正负
		flag = 1;

	else if(ch >= '0' && ch <= '9')			//得到完整的数
		res = ch - '0';
	while((ch = getchar()) >= '0' && ch <= '9' )
		res = res * 10 + ch - '0';

	return flag ? -res : res;
}
/*----------------PLEASE-----DO-----NOT-----HACK-----ME--------------------*/



int a[100000+5];
int left1[100000+5];
int right1[100000+5];
long long int cnt;
void merge1(int *a,int p,int q,int r)
{
    int i,j,n1,n2;
    n1=q-p+1;
    n2=r-q;
    for(int i=0;i<n1;i++)
    {
        left1[i]=a[i+p];
    }
    for(int i=0;i<n2;i++)
    {
        right1[i]=a[i+q+1];
    }
    left1[n1]=INT_MAX;
    right1[n2]=INT_MAX;
    i=j=0;
    for(int k=p;k<=r;k++)
    {
        if(left1[i]<=right1[j])
        {a[k]=left1[i];
        i++;}
        else
        {
            a[k]=right1[j];
            j++;
            cnt+=n1-i;
        }
    }

}
void mergesort(int *a,int p,int r)
{
    if(p>=r)
        return ;
    int q=(p+r)/2;
    mergesort(a,p,q);
    mergesort(a,q+1,r);
    merge1(a,p,q,r);

}
int main()
{
int n,k;
while(RII(n,k)!=EOF)
{
    for(int i=0;i<n;i++)
      RI(a[i]);
    cnt=0;
    mergesort(a,0,n-1);
    printf("%I64d\n",max(cnt-k,(long long )0));


}


        return 0;
}