/*
zju 1484-Minimum Inversion Number
written by lky
2008-03-05 13:00
类似动态规划:当一个数移到最后以后,它的逆序数为前一个序列的逆序数+比他大的数的个数-比他小的数的个数
*/
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[5001];
int n;
int i, j;
int Min;
while (scanf("%d", &n) != EOF)
{
for (i=0; i<n; ++i)
{
scanf("%d", &a[i]);
}
int sum = 0;
for (i=0; i<n; ++i)
{
for (j=i+1; j<n; ++j)
{
if(a[i]>a[j])
++sum;
}
}
Min = sum;
for (j=1; j<n; ++j)
{
int t = a[0];
for (i=1; i<n; ++i)
{
a[i-1] = a[i];
}
a[n-1] = t;
for (i=0; i<n-1; ++i)
{
if(a[i] > a[n-1])
++sum;
if(a[i] < a[n-1])
--sum;
}
if(sum < Min)
Min = sum;
}
printf("%d/n", Min);
}
return 0;
}
zju 1484-Minimum Inversion Number
written by lky
2008-03-05 13:00
类似动态规划:当一个数移到最后以后,它的逆序数为前一个序列的逆序数+比他大的数的个数-比他小的数的个数
*/
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
int a[5001];
int n;
int i, j;
int Min;
while (scanf("%d", &n) != EOF)
{
for (i=0; i<n; ++i)
{
scanf("%d", &a[i]);
}
int sum = 0;
for (i=0; i<n; ++i)
{
for (j=i+1; j<n; ++j)
{
if(a[i]>a[j])
++sum;
}
}
Min = sum;
for (j=1; j<n; ++j)
{
int t = a[0];
for (i=1; i<n; ++i)
{
a[i-1] = a[i];
}
a[n-1] = t;
for (i=0; i<n-1; ++i)
{
if(a[i] > a[n-1])
++sum;
if(a[i] < a[n-1])
--sum;
}
if(sum < Min)
Min = sum;
}
printf("%d/n", Min);
}
return 0;
}