HDU-1394 Minimum Inversion Number

Minimum Inversion Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24124    Accepted Submission(s): 14289
 

Problem Description

The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.
For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers to the end of the seqence, we will obtain another sequence. There are totally n such sequences as the following:
a1, a2, ..., an-1, an (where m = 0 - the initial seqence)
a2, a3, ..., an, a1 (where m = 1)
a3, a4, ..., an, a1, a2 (where m = 2)
...
an, a1, a2, ..., an-1 (where m = n-1)
You are asked to write a program to find the minimum inversion number out of the above sequences.

Input

The input consists of a number of test cases. Each case consists of two lines: the first line contains a positive integer n (n <= 5000); the next line contains a permutation of the n integers from 0 to n-1.

Output

For each case, output the minimum inversion number on a single line.

Sample Input

10

1 3 6 9 0 8 5 7 4 2

Sample Output

16

树状数组求逆序数

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

int n;
int num[5050],tr[5051];

int lowbit( int x ){
	return x & -x;
}

void insert( int pos , int v ){
	for( ; pos<=5050 ; pos += lowbit( pos ) )
		tr[pos] += v;
}

int query( int pos ){
	int ans = 0;
	while( pos ){
		ans += tr[pos];
		pos -= lowbit( pos );
	}
	return ans;
}

int main(){
//  freopen( "in.txt","r",stdin );
    std::ios::sync_with_stdio( false );
	int v,ans,cnt;
	while( cin >> n ){
		memset( num,0,sizeof(num) );
		memset( tr,0,sizeof(tr) );
		ans = 0;
		for( int i=1 ; i<=n ; i++ ){
			cin >> num[i];
			ans += query( n+1 ) - query( num[i]+1 );
			insert( num[i]+1,1 );
		}
		cnt = ans;
		for( int i=1 ; i<=n ; i++ ){
			cnt += n-1-num[i]-num[i];
			ans = min( ans,cnt );
		} 
		cout << ans << endl;
	}
}