Minimum Inversion Number(线段树求逆序数)

Minimum Inversion Number

题目链接
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

题目大意

求逆序数，一个数列的全排列，问其中逆序数最小的情况时多少，逆序数就是数列中每个数字，后面有几个比他小的数字比如，每个逆序数为
1 3 6 9 0 8 5 7 4 2
1 2 4 6 0 4 2 2 1 0
其中6的逆序数为（0，5，4，2）一共4个，所以该数列逆序数为22个

代码实现

#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm> 
#include<string>
#include<cstring>
using namespace std;
typedef long long ll;
const int maxn=5e3+5;
struct node {
	int l,r;
	int sum;
}tr[maxn<<2];
int w[maxn];
void up(int u)
{
	tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum ;
 } 
void build(int u,int l,int r)
{
	tr[u].l=l,tr[u].r=r;
	tr[u].sum=0;
	if(l==r)
	{
		return ;
	}
	else
	{
		int mid=l+r>>1;
		build(u<<1,l,mid);
		build(u<<1|1,mid+1,r);
	 } 
}
void updata(int u,int pos)
{
	if(tr[u].l==tr[u].r&&tr[u].l==pos)	
	{
		tr[u].sum=1;
		 return ;
	} 
	int mid=(tr[u].l+tr[u].r)>>1;
	if(pos<=mid) updata(u<<1,pos);
	else	updata(u<<1|1,pos);
	up(u);
}
int quary(int u,int l,int r)
{
	if(tr[u].l>=l&&tr[u].r<=r)
	{
		return tr[u].sum;
	}
	int mid=tr[u].l+tr[u].r>>1;
	int res=0;
	if(l<=mid) res+=quary(u<<1,l,r);
	if(r>mid)  res+=quary(u<<1|1,l,r);
	return res;
}
int main()
{
	int n;
	while(cin>>n)
	{
		int minn=99999999;
		build(1,0,n-1);
		int ans=0;
		for(int i=0;i<=n-1;i++)
		{
			scanf("%d",&w[i]);
			ans+=quary(1,w[i]+1,n-1);
			updata(1,w[i]);
		}
		minn=min(minn,ans);
		for(int i=0;i<=n-1;i++)
		{
			ans=ans-w[i]+n-w[i]-1;
			minn=min(ans,minn);
		}
		printf("%d\n",minn);
	}
	return 0;
}