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
题解:求循环移位后逆序数的最小值。其实主要就是求序列的逆序数。逆序数的求法很多,可以用归并排序求,也可以用树状数组和线段树求逆序数。
逆序数求得之后,把第一个数移到最后的逆序数是可以直接得到的。比如原来的逆序数是ans,把a[0]移到最后后,减少逆序数a[0],同时增加逆序数n-a[0]-1个,就是ans-a[0]+n-a[0]-1;只要i从0-n-1循环一遍取最小值就可以了。
代码如下:
#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>
#define maxn 32007
#define N 200005
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define eps 0.000000001
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define Debug(x) cout<<x<<" "<<endl
#define lson i << 1,l,m
#define rson i << 1 | 1,m + 1,r
using namespace std;
typedef long long ll;
int c[maxn];
int n;
void add(int k,int v)
{
while(k<=n)
{
c[k]+=v;
k+=lowbit(k);
}
}
int sum(int k)
{
int ans=0;
while(k>0)
{
ans+=c[k];
k-=lowbit(k);
}
return ans;
}
int a[maxn];
int main()
{
while(scanf("%d",&n)!=EOF)
{
int ans=0;
memset(c,0,sizeof(c));
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
ans+=sum(n)-sum(a[i]+1);
add(a[i]+1,1);
}
int min1=ans;
for(int i=1;i<=n;i++)
{
ans+=n-a[i]-(a[i]+1);
min1=min(min1,ans);
}
printf("%d\n",min1);
}
return 0;
}