就是求所有序列的最小逆序数。而当第一个数放到最后,逆序数的序列改变量为 Case - 2 * A[i] - 1
线段数和暴力都能过的。
// File Name: hdu1394.cpp
// Author: Toy
// Created Time: 2013年03月09日 星期六 10时19分17秒
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
using namespace std;
int Case, ar[5050], x, A[5050], ans, tmp;
int Lowbit ( int t ) {
return t & ( -t );
}
int sum ( int x ) {
int ret = 0;
for ( ; x > 0; ret += ar[x], x -= Lowbit ( x ) ) ;
return ret;
}
void add ( int x, int d ) {
for ( ; x <= Case; ar[x] += d, x += Lowbit ( x ) ) ;
}
int main ( ) {
while ( scanf ( "%d", &Case ) != EOF ) {
tmp = 0;
memset ( ar, 0, sizeof ( ar ) );
for ( int i = 1; i <= Case; ++i ) {
scanf ( "%d", &A[i] );
add ( A[i] + 1, 1 );
tmp += sum ( Case ) - sum ( A[i] + 1);
}
ans = tmp;
for ( int i = 1; i <= Case; ++i ) {
tmp += Case - 2 * A[i] - 1; //求逆序数的改变量
if ( ans > tmp ) ans = tmp;
}
printf ( "%d\n", ans );
}
return 0;
}