HDU 1394 Minimum Inversion Number (离散化 + 树状数组 求逆序对)

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 <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 50010
int bit[N], a[N], b[N];
int n, ans;
inline int lowbit(int i) { return i & -i; }
void discrete()
{
	for (int i = 1; i <= n; i++) b[i] = a[i];
	sort(b + 1, b + 1 + n);
	int size = unique(b + 1, b + 1 + n) - b - 1;
	for (int i = 1; i <= n; i++)
		a[i] = lower_bound(b + 1, b + 1 + size, a[i]) - b;
}
void add(int i, int key)
{
	for (; i <= n; i += lowbit(i)) bit[i] += key;
}
int sum(int i)
{
	int ans = 0;
	for (; i; i -= lowbit(i)) ans += bit[i];
	return ans;
}
int main()
{
	while (~scanf("%d", &n))
	{
		memset(bit, 0, sizeof(bit));
		for (int i = 1; i <= n; i++) scanf("%d", &a[i]), a[i]++;
		discrete();
		ans = 0;
		for (int i = n; i; i--)
		{
			ans += sum(a[i] - 1);
			add(a[i], 1);
		}
		int now = ans;
		for (int i = 1; i < n; i++)
		{
			int small = sum(a[i] - 1);
			now = now - small + n - small - 1;
			ans = min(ans, now);
		}
		printf("%d\n", ans);
	}
	return 0;
}