HDU 1394 Minimum Inversion Number （求逆序数）

题意：给定了一个0--n-1 的序列，现在可能通过循环移动，共产生n种序列，求出哪种序列有最少的逆序数

偶然瞄上这题，差点忘了如何求逆序数了..........通过线段树或树状数组维护，求出一种序列的逆序数，然后每次循环右移 ans = ans - n + 1 + 2 * a[i];

找出最小的即可

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <climits>//形如INT_MAX一类的
#define MAX 5111
#define INF 0x7FFFFFFF
#define L(x) x<<1
#define R(x) x<<1|1
//#pragma comment(linker, "/STACK:36777216") ///传说中的外挂
using namespace std;


struct node {
    int l,r,mid;
    int sum;
} tree[MAX*4];

int n;
int a[MAX];

void up(int num) {
    tree[num].sum = tree[L(num)].sum + tree[R(num)].sum;
}

void build(int l,int r,int num) {
    tree[num].l = l;
    tree[num].r = r;
    tree[num].mid = (l+r) >> 1;
    tree[num].sum = 0;
    if(l == r) {
        return ;
    }
    build(l,tree[num].mid,L(num));
    build(tree[num].mid + 1,r,R(num));
    up(num);
}

void update(int l,int x) {
    if(tree[x].l == tree[x].r) {
        tree[x].sum = 1;
        return ;
    }
    if(l > tree[x].mid) update(l,R(x));
    else update(l,L(x));
    up(x);
}

int query(int l,int r,int num) {
    if(l == tree[num].l && tree[num].r == r) {
        return tree[num].sum;
    }
    if(r <= tree[num].mid) {
        return query(l,r,L(num));
    } else if(l > tree[num].mid) {
        return query(l,r,R(num));
    } else {
        return query(l,tree[num].mid,L(num)) + query(tree[num].mid+1,r,R(num));
    }
}


int main() {
    while(cin >> n) {
        for(int i=0; i<n; i++) scanf("%d",&a[i]);
        int ans = 0;
        build(1,n,1);
        for(int i=0; i<n; i++) {
            ans += query(a[i]+1,n,1);
            update(a[i]+1,1);
        }
        int minn = ans;
        for(int i=n-1; i>0; i--) {
            ans = ans - n + 1 + 2 * a[i];
            minn = min(minn,ans);
        }
        cout << minn << endl;
    }
    return 0;
}