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): 17077    Accepted Submission(s): 10370

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 <stdio.h>
#include <algorithm>
using namespace std;
const int maxn = 5050;
int sum[maxn<<2], n;
int a[maxn];

#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1

int query(int L, int R, int l, int r, int rt)
{
	if (L <= l&&r <= R)
	{
		return sum[rt];
	}
	int ret = 0;
	int m = (l + r) >> 1;
	if (L <= m) ret += query(L, R, lson);
	if (R > m) ret += query(L, R, rson);
	return ret;
}

void update(int id, int l, int r, int rt)
{
	if (l == r)
	{
		sum[rt]++;
		return;
	}
	int m = (l + r) >> 1;
	if (id <= m) update(id, lson);
	else update(id, rson);
	sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

int main()
{
	while (scanf("%d", &n) != EOF)
	{
		memset(sum, 0, sizeof(sum));
		int ret = 0;
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &a[i]);
			ret += query(a[i] + 1, n - 1, 0, n - 1, 1);
			update(a[i], 0, n - 1, 1);
		}
		int t = ret;
		for (int i = 0; i < n; i++)
		{
			t = t - a[i] - a[i] + n - 1;
			ret = min(ret, t);
		}
		printf("%d\n", ret);
	}
	return 0;
}