hdu3743Frosh Week

用树状数组求逆序对数，没说编号由1到n所以要将其编号离散化，否则总是数组越界啊，吃一堑长一智啊。。。区间修改，点查询是向下修改，向后求和。点修改，区间查询是向后修改，向前求和。

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL __int64
const int maxn =  1000111;
using namespace std;
struct node
{
    int x,i;
    bool operator <(const node &n)const
    {
        return x<n.x;
    }
} c[maxn];
int b[maxn],num[maxn],n;
int lowbit(int x)
{
    return x&(-x);
}
void add(int i,int x)
{
    while(i)
    {
        b[i]+=x;
        i-=lowbit(i);
    }
}
LL sum(int i)
{
    LL sum=0;
    while(i<=n)
    {
        sum+=b[i];
        i+=lowbit(i);
    }
    return sum;
}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        for(int i=1; i<=n; i++)
        {
            b[i]=0;
            scanf("%d",&num[i]);
            c[i].x=num[i];
            c[i].i=i;
        }
        sort(c+1,c+1+n);
        for(int k=1; k<=n; k++)
            num[c[k].i]=k;
        LL total=0;
        for(int i=1; i<=n; i++)
        {
            total+=sum(num[i]);
            add(num[i],1);
        }
        cout<<total<<endl;
    }
    return 0;
}