SGU 180 Inversions（树状数组求逆序对）

思路：典型的树状数组求逆序对，需要离散化并且数字可能有重复的

#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn = 70000+50;
LL c[maxn];
int a[maxn],b[maxn];
vector<int>v;
int getid(int x){return lower_bound(v.begin(),v.end(),x)-v.begin()+1;}
int lowbit(int x){return x&(-x);}
int n;
void update(int i,int num)
{
	while(i<=maxn)
	{
		c[i]+=num;
		i+=lowbit(i);
	}
}
LL query(int x)
{
	LL ans = 0;
	while(x)
	{
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}
int main()
{
    scanf("%d",&n);
	{
		memset(c,0,sizeof(c));
		v.clear();
		for(int i = 1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			b[i]=a[i];
			v.push_back(a[i]);
		}
		sort(b+1,b+1+n);
		for(int i = 1;i<=n;i++)
			a[i]=lower_bound(b+1,b+1+n,a[i])-b;
		//v.push_back(maxn);
		//sort(v.begin(),v.end());
		//v.erase(unique(v.begin(),v.end()),v.end());
		LL ans = 0;
        for(int i = 1;i<=n;i++)
		{
			update(a[i],1);
			ans+=a[i]-query(a[i]-1)-1;
           // ans+=query((maxn))-query((a[i]));
			//update((a[i]),1);
		}
		printf("%I64d\n",ans);
	}	
}

Description

 

180. Inversions

time limit per test: 0.5 sec.
memory limit per test: 4096 KB

input: standard
output: standard

There are N integers (1<=N<=65537)  A1,  A2,.. AN (0<=Ai<=10^9). You need to find amount of such pairs (i, j) that 1<=i<j<=N and A[i]>A[j].

Input

The first line of the input contains the number N. The second line contains N numbers A1...AN.

Output

Write amount of such pairs.

Sample test(s)

Input

 

5
2 3 1 5 4

 

 

Output

 

3

 

 

Author:	Stanislav Angelyuk
Resource:	Saratov ST team Spring Contest #1
Date:	18.05.2003

Server time: 2013-08-11 22:32:23 Online Contester Team © 2002 - 2013. All rights reserved.