【题目】
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
【分析】
题目大意:给出一个 1 1 1 ~ n n n 的排列,可以不断地把第一个数放到最后,求所有方案中逆序对的最小值
先求出原始序列中的逆序对个数,然后考虑把第一个数放到最后的贡献
由于这是一个排列,假设第一个数为 x x x,那么小于 x x x 的数有 x − 1 x-1 x−1 个,大于它的有 n − x n-x n−x 个
所以每次更新就直接 s u m = s u m − ( x − 1 ) + ( n − x ) sum=sum-(x-1)+(n-x) sum=sum−(x−1)+(n−x),记一下最小值即可
P
s
Ps
Ps:原题中给出的是
0
0
0 ~
n
−
1
n-1
n−1 的排列,我是直接加
1
1
1 变成
1
1
1 ~
n
n
n 的排列
【代码】
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 5005
#define lowbit(x) x&-x
#define inf (1ll<<31ll)-1
using namespace std;
int n,a[N],tree[N];
void add(int i,int x)
{
while(i<=n)
{
tree[i]+=x;
i+=lowbit(i);
}
}
int query(int i)
{
int ans=0;
while(i>=1)
{
ans+=tree[i];
i-=lowbit(i);
}
return ans;
}
int main()
{
int i;
while(~scanf("%d",&n))
{
int sum=0;
memset(tree,0,sizeof(tree));
for(i=1;i<=n;++i)
{
scanf("%d",&a[i]);
a[i]++,add(a[i],1);
sum+=i-query(a[i]);
}
int Min=sum;
for(i=1;i<n;++i)
{
sum=sum-(a[i]-1)+(n-a[i]);
Min=min(Min,sum);
}
printf("%d\n",Min);
}
return 0;
}