HDU 1394 Minimum Inversion Number

最新推荐文章于 2024-05-07 07:50:01 发布

Dreamlandzxx

最新推荐文章于 2024-05-07 07:50:01 发布

阅读量353

点赞数

分类专栏：线段树

本文链接：https://blog.csdn.net/Dreamlandz/article/details/52087773

版权

线段树专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Minimum Inversion Number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17660 Accepted Submission(s): 10711

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<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int Max=222222;
int node[Max<<2],a[Max];
void build(int l,int r,int rt)
{
    node[rt]=0;
    if(l==r)
    {
        return;
    }
    int m=(l+r)/2;
    build(lson);
    build(rson);
}
void modify(int p,int l,int r,int rt)
{
    if(l==r)
    {
        node[rt]=1;
        return;
    }
    int m=(l+r)/2;
    if(p<=m)
    {
        modify(p,lson);
    }
    else
    {
        modify(p,rson);
    }
    node[rt]=node[rt<<1]+node[rt<<1|1];
}
int query(int L,int R,int l,int r,int rt)
{
    if(L<=l&&r<=R)
    {
        return node[rt];
    }
    int m=(l+r)/2;
    int summ=0;
    if(L<=m)
    {
       summ+=query(L,R,lson);
    }
    if(R>m)
    {
        summ+=query(L,R,rson);
    }
    //node[rt]=node[rt<<1]+node[rt<<1|1];
    return summ;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int ans=0,i;
        build(0,n-1,1);
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            ans+=query(a[i],n-1,0,n-1,1);
            modify(a[i],0,n-1,1);
        }
        int ret=ans;
        for(i=0;i<n;i++)
        {
            ans+=(n-a[i]-a[i]-1);
            ret=min(ret,ans);
        }
        printf("%d\n",ret);

    }
    return 0;
}