#include <stdio.h>#include <stdlib.h>int Data[ 5005 ];int Save[ 5005 ];int Answ[ 5005 ];int MergeSort( int a, int b ){ if ( a < b ) { int L = MergeSort( a, (a+b)/2 ); int R = MergeSort( (a+b)/2+1, b ); int Count = L+R,move = a; int ps = a,pe = (a+b)/2; int qs = (a+b)/2+1,qe = b; while ( ps <= pe || qs <= qe ) if ( qs <= qe && ( ps == pe+1 || Data[ ps ] > Data[ qs ] ) ) { Save[ move ++ ] = Data[ qs ++ ]; Count += pe-ps+1; }else Save[ move ++ ] = Data[ ps ++ ]; for ( int i = a ; i <= b ; ++ i ) Data[ i ] = Save[ i ]; return Count; }else return 0;} int main(){ int n; while ( scanf("%d",&n) != EOF ) { for ( int i = 1 ; i <= n ; ++ i ) scanf("%d",&Data[ i ]); for ( int i = 1 ; i <= n ; ++ i ) Answ[ i ] = Data[ i ]; int V = MergeSort( 1, n ); int Min = V; for ( int i = 1 ; i < n ; ++ i ) { V += n - 2*Answ[ i ] - 1; if ( V < Min ) Min = V; } printf("%dn",Min); } return 0;}
