hdu 1394 Minimum Inversion Number 用线段树求0到n-1的排列的逆序数

把第一个数拿到最后去，逆序数的变化量 = N - 1 - 2*a[i]

用线段树统计当前比该数大的数有多少个，动态更新，动态查询 

//46MS	408K
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define lch(x) (2*(x) + 1)
#define rch(x) (2*(x) + 2)
using namespace std;

const int MAX_N = 5000;
int tree[MAX_N<<2], a[MAX_N+5];
int N, NN;

void init_NN(){
    NN = 1;
    while(NN < N) NN <<= 1;
}

void build(){
    memset(tree, 0, sizeof tree);
}

void update(int pos){
    int p = pos + NN - 1;
    while(true){
        tree[p]++;
        if(p == 0) break;
        p = (p-1)/2;
    }
}

int query(int a, int b, int n, int l, int r){
    if(a <= l && r <= b) return tree[n];
    int mid = (l+r)>>1;
    if(mid < a) return query(a, b, rch(n), mid+1, r);
    else if(mid+1 > b) return query(a, b, lch(n), l, mid);
    else return query(a, b, rch(n), mid+1, r) + query(a, b, lch(n), l, mid);
}

int main(){
    while(~scanf("%d", &N)){
        init_NN();
        for(int i=1; i<=N; i++)
            scanf("%d", &a[i]);
        build();
        int res = 0;
        for(int i=1; i<=N; i++){
            update(a[i]);
            res += query(a[i]+1, NN-1, 0, 0, NN-1);
        }
        int minres = res, now = res;
        for(int i=1; i<=N-1; i++){
            now += N - 1 - 2*a[i];
            if(now < minres) minres = now;
        }
        printf("%d\n", minres);
    }
    return 0;
}