POJ 2299 Ultra-QuickSort(树状数组+离散化)

第一道树状数组+离散化 的题目,纪念下

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=500010;
int temp[maxn],tree[maxn],n;

struct node{
	int n,id;
	bool operator<(const node &rhs)const{
		return n<rhs.n;
	}	
}nums[maxn];
int lowbit(int x){
	return x&(-x);
}
void update(int x,int c){
	for(int i=x;i<=n;i+=lowbit(i)){
		tree[i]+=c;
	}
}
int getSum(int x){
	int sum=0;
	for(int i=x;i>=1;i-=lowbit(i)){
		sum+=tree[i];
	}
	return sum;
}
int main(){
	while(scanf("%d",&n)&&n){
		memset(temp,0,sizeof(temp));
		memset(tree,0,sizeof(tree));
		long long ans=0;
		for(int i=1;i<=n;++i){
			scanf("%d",&nums[i].n);
			nums[i].id=i;
		}
		sort(nums+1,nums+1+n);
		for(int i=1;i<=n;++i){
			temp[i]=nums[i].id;
		}
		for(int i=1;i<=n;++i){
			update(temp[i],1);
			ans+=getSum(n)-getSum(temp[i]);
		}
		printf("%lld\n",ans);
	}
	return 0;
}