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<iostream>
#include<cstdio>
using namespace std;
#define N 5005
struct Seg_Tree
{
    int l,r;
    int num;
}tree[4*N];

void createTree(int i,int l,int r)
{
    int mid=(l+r)/2;
    tree[i].l=l;
    tree[i].r=r;
    tree[i].num=0;
    if(l==r)
    {
        return ;
    }
    createTree(i*2,l,mid);
    createTree(i*2+1,mid+1,r);
}
void updata(int i,int k)
{
    if(tree[i].l==k&&tree[i].r==k)
    {
        tree[i].num=1;
        return ;
    }
    int mid=(tree[i].l+tree[i].r)/2;
    if(k<=mid)
        updata(i*2,k);
    else
        updata(i*2+1,k);
    tree[i].num=tree[i*2].num+tree[i*2+1].num;
}
int getsum(int i,int k,int n)
{
    if(k<=tree[i].l&&tree[i].r<=n)
    {
        return tree[i].num;
    }
    else
    {
        int mid=(tree[i].l+tree[i].r)/2;
        int sum1=0,sum2=0;
        if(k<=mid)
            sum1=getsum(i*2,k,n);
        if(n>mid)
            sum2=getsum(i*2+1,k,n);
        return sum1+sum2;
    }
}
int main()
{
   // freopen("a.in","r",stdin);
    int n;
    while(scanf("%d",&n)>0)
    {
        int a[N];
        createTree(1,0,n-1);
        int i;
        int ans=0;
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            ans+=getsum(1,a[i]+1,n-1);
            updata(1,a[i]);
        }
        int minx=ans;
        for(i=0;i<n;i++)
        {
            ans=ans+n-2*a[i]-1;
            if(ans<minx)
                minx=ans;
        }
        printf("%d\n",minx);
    }
    return 0;
}