hdu1394 Minimum Inversion Number

又学到了一道求逆序数的题目

线段树功能：update 单点增减， query 区间和

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define ull unsigned long long
#define eps 1e-8
#define inf 0x3f3f3f3f
#define lson l, m, rt << 1
#define rson m+1, r, rt << 1 | 1
#define mnx 5555
int sum[mnx<<2], a[mnx];
void pushup( int rt ){
	sum[rt] = sum[rt<<1] + sum[rt<<1|1];
}
void update( int p, int l, int r, int rt ){
	if( l == r ){
		sum[rt] = 1;
		return ;
	}
	int m = ( l + r ) >> 1;
	if( p <= m ) update( p, lson );
	else update( p, rson );
	pushup( rt );
}
int query( int L, int R, int l, int r, int rt ){
	if( L <= l && R >= r ){
		return sum[rt];
	}
	int ret = 0, m = ( l + r ) >> 1;
	if( L <= m )  ret += query( L, R, lson );
	if( R > m )  ret += query( L, R, rson );
	return ret;
}
int main(){
	int n;
	while( scanf( "%d", &n ) != EOF ){
		memset( sum, 0, sizeof(sum) );
		int ans = 0;
		for( int i = 0; i < n; i++ ){
			scanf( "%d", &a[i] );
			ans += query( a[i], n-1, 0, n-1, 1 );       // 这种线段树的办法求逆序数感觉挺奇妙的 
			update( a[i], 0, n-1, 1 );                  
		}
		int ret = ans;
		for( int i = 0; i < n-1; i++ ){
			ret += ( ( n - a[i] - 1 ) - a[i] );  //(n-a[i]-1)表示换到最后面后，前面有几个数字比a[i]大，
			                                     // a[i]表示在最前面时候，后面有几个数字比a[i]小 
			ans = min( ans, ret );
		}
		printf( "%d\n", ans );
	}
	return 0;
}