poj 2299（权值线段树）

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<queue>
#include<vector>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=1e6+10;
int a[N],b[N],f[N],n;
struct Node 
{
    int l,r,sum;
    Node *lch,*rch;
}*root;
void build(Node *x,int l,int r) 
{
    x->l=l;
    x->r=r;
    x->sum=0;
    if(l<r) {
        x->lch=new Node;
        x->rch=new Node;
        int m=(x->l+x->r)>>1;
        build(x->lch,l,m);
        build(x->rch,m+1,r);
    }
    else x->lch=x->rch=NULL;
}
void change(Node *x,int pos,int delta)
{
    if(x->l==x->r&&x->l==pos) {
        x->sum+=delta;
    }
    else {
        int m=(x->l+x->r)>>1;
        if(pos<=m) change(x->lch,pos,delta);
        else       change(x->rch,pos,delta);
        x->sum=x->lch->sum+x->rch->sum;
    }
}
int query(Node *x,int l,int r) 
{
    if(x->l>=l&&x->r<=r) {
        return x->sum;
    }
    else {
        int m=(x->l+x->r)>>1;
        int ans=0;
        if(l<=m) ans+=query(x->lch,l,r);
        if(r>m)  ans+=query(x->rch,l,r);
        return ans;
    }
}
int main()
{
    while(scanf("%d",&n)&&n){
    for(int i=1;i<=n;i++) {
    scanf("%d",&a[i]);
    b[i]=a[i];
    }
    sort(b+1,b+1+n);
    int size=unique(b+1,b+1+n)-b-1;
    int maxsz=-1;
    for(int i=1;i<=n;i++) {
        f[i]=lower_bound(b+1,b+1+size,a[i])-b;
        maxsz=max(maxsz,f[i]);
    }
    root=new Node;
    build(root,0,maxsz);
    long long ans=0;
    for(int i=1;i<=n;i++) {
        ans+=query(root,f[i]+1,maxsz);
        change(root,f[i],1);
    }
    printf("%lld\n",ans);
    }
    return 0;
}