poj_2299

题目链接：http://poj.org/problem?id=2299

题目大意就是叫你求逆序数对。

求逆序数对的话我们通常用树状数组来求。

原理是这样的：首先我们将输入离散化：比如题中的 9 1 0 5 4,我们排序后可以离散化成 5 2 1 4 3，大小关系与原数组相同。离散化后我们就开始用树状数组来求

1 2 3 4 5

0 0 0 0 0

第一步向上修改upDate(a[i],1)，即将5的对应值+1

1 2 3 4 5

0 0 0 0 1

然后 ans += (i-getSum(a[i])) 此时i=1,getSum(a[i])求得是小于等于a[i]的数的对应值之和，即a[1]+a[2]+a[3]+a[4]+a[5]=1, i-getSum(a[i]) = 0,

当i==2时，upDate(a[i],1)即将2的值+1

1 2 3 4 5

0 1 0 0 1

然后getSum(a[i]) = a[1]+a[2] = 1, i-getSum(a[i]) = 2-1=1,即对于2来说，逆序对数为1(其实就是(5,2)，这个求法是枚举一个数，然后看它前面有几个比它大的数，就是逆序对数)

当i==3时，upDate(a[i],1)，即将1的值+1

1 2 3 4 5

1 1 0 0 1

然后getSum(a[i]) = a[1] = 1,i-getSum(a[i]) = 3-1=2，即对于1来说，逆序对数为2( (5,1),(2,1)))

.......最后求得的就是总的逆序对数啦。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 110
#define M 1000100
int a[M];
struct Node{
	int v,id;
	bool operator < (const Node &x) const{
		return v<x.v;
	}
}p[M];
ll c[M];
int lowbit(int x){
	return x&(-x);
}
void upDate(int x,int v){	//向上修改
	while(x<=n){
		c[x] += v;
		x += lowbit(x);
	}
}
ll getSum(int x){		//向下求和
	ll ans = 0;
	while(x>0){
		ans += c[x];
		x -= lowbit(x);
	}
	return ans;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    	while(sf(n)!=EOF && n){
    		memset(c,0,sizeof c);
    		for(int i=1;i<=n;i++){
    			p[i].id = i;
    			sf(p[i].v);
    		}
    		sort(p+1,p+n+1);
    		for(int i=1;i<=n;i++)	//离散化
    			a[p[i].id] = i;
    		ll ans = 0;
    		for(int i=1;i<=n;i++){
    			upDate(a[i],1);
    			ans += (i-getSum(a[i]));
    		}
    		printf("%I64d\n",ans);
    	}
return 0;
}

当然，求逆序对还有一种方法，就是在归并排序的过程中统计逆序对的个数，这也很方便。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 110
#define M 1000100
int a[M];
int t[M];
ll ans;
void Merge_Sort(int x,int y){
	if(y-x<=1) return;
	int mid = (x+y)>>1;
	Merge_Sort(x,mid);
	Merge_Sort(mid,y);
	int p = x,q = mid,i = x;
	while(p<mid || q<y){
		if(q>=y || (p<mid && a[p]<=a[q]))
			t[i++] = a[p++];
		else{		//(p==mid || a[q]<a[p])
			if(p<mid)
			 ans += (mid-p);	//a[p] is the first element that is bigger than a[q],so the number is mid-p;
			t[i++] = a[q++];
		}
	}
	for(i=x;i<y;i++)
		a[i] = t[i];
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    	while(sf(n)!=EOF && n){
    		for(int i=0;i<n;i++)
    			sf(a[i]);
    		ans = 0;
    		Merge_Sort(0,n);
    		printf("%I64d\n",ans);
    	}
return 0;
}