hdu 1394 线段树

求出最初的的逆序数之后，有公式直接求其他的。。。。很容易推，自己推。。。。

AC代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define MAX 5000

int sum[4*MAX];

void PushUp( int rt ){
	sum[rt] = sum[rt*2] + sum[rt*2+1];
}

void built( int l, int r, int rt ){
	sum[rt] = 0;
	if( l == r ){
		return;
	}
	int mid = ( l + r ) >> 1;
	built( l, mid, rt * 2 );
	built( mid + 1, r, rt * 2 + 1 );
}

void Updata( int id, int l, int r, int rt ){
	if( l == r ){
		sum[rt]++;
		return;
	}
	int mid = ( l + r ) >> 1;
	if( id <= mid )	Updata( id, l, mid, rt * 2 );
	else Updata( id, mid + 1, r, 2 * rt + 1 );
	PushUp( rt );
}

int query( int L, int R, int l, int r, int rt ){
	if( L <= l && R >= r ){
		return sum[rt];
	}
	int ans = 0;
	int mid = ( l + r ) >> 1;
	if( L <= mid ) ans += query( L, R, l, mid, rt * 2 );
	if( R > mid ) ans += query( L, R, mid + 1, r, rt * 2 + 1 );
	return ans;
}

int main(){
	int N, num[5100];

	while( scanf( "%d", &N ) != EOF ){
		built( 0, N - 1, 1 );
		int sum = 0;
		for( int i = 0; i < N; i++ ){
			scanf( "%d", &num[i] );
			sum += query( num[i], N - 1, 0, N -1, 1 );
			Updata( num[i], 0, N - 1, 1 );
		}
		int ans = sum;
		for( int i = 0; i < N; i++ ){
			sum = sum + ( N - 1 - num[i] ) - num[i];
			ans = min( ans, sum );
		}
		cout << ans << endl;
	}
	return 0;
}