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
  
  

Author

CHEN, Gaoli

Source

ZOJ Monthly, January 2003 

想建立 一个线段树，然后查看大小 ，效率较高

#include<stdio.h>
int a[15000];
struct ele
{
    int left;
    int right;
    int sum;
} p[60000];
void build(int x,int y,int step)
{
    p[step].left=x;
    p[step].right=y;
    p[step].sum=0;
    if(x==y)
        return;
    else
    {
        int Mid=(x+y)/2;
        build(x,Mid,2*step);
        build(Mid+1,y,2*step+1);
    }
}
void update(int i,int step)
{
    if(p[step].left==i&&p[step].right==i)
        p[step].sum=1;
    else
    {
        int Mid=(p[step].left+p[step].right)/2;
        if(i<=Mid)
            update(i,2*step);
        else
            update(i,2*step+1);
        p[step].sum=p[2*step].sum+p[2*step+1].sum;
    }
}
int get(int x,int y,int step)
{
    if(p[step].left==x&&p[step].right==y)
        return p[step].sum;
    else
    {
        int Mid=(p[step].left+p[step].right)/2;
        if(y<=Mid)
            return get(x,y,2*step);
        else
        if(x>=Mid+1)
            return get(x,y,2*step+1);
        else
            return get(x,Mid,2*step)+get(Mid+1,y,2*step+1);
    }
}
int main()
{
    int n;
    int i;
    int ans;
    while(scanf("%d",&n)!=EOF)
    {
        ans=0;
        build(1,n,1);
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            if(a[i]+2<=n)
                ans+=get(a[i]+2,n,1);
         //   printf("%d\n",ans);
            update(a[i]+1,1);
        }
        int Min=ans;
        for(i=1;i<=n;i++)
        {
            ans=ans+(n-1-a[i])-a[i];
            if(ans<Min)
                Min=ans;
        }
        printf("%d\n",Min);
    }




    return 0;
}