需求:单点更新,区间求和。
先一遍找出各点左边有多少个比自身大的数,即逆序对,然后把队首元素移动到队尾,刚好原来呈现逆序的消失,不呈现逆序的出现。
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <bitset>
#include <memory>
#include <complex>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <ctype.h>
#include <locale.h>
using namespace std;
#pragma pack(4)
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x7f7f7f7f;
const __int64 INF = 0x7f7f7f7f7f7f7f7fll;
#define loop(a,n) \
for(int i=0;n>i;i++) \
cout<<a[i]<<(i!=n-1?' ':'\n')
#define loop2(a,n,m) \
for(int i=0;n>i;i++) \
for(int j=0;m>j;j++) \
cout<<a[i][j]<<(j!=m-1?' ':'\n')
#define at(a,i) ((a)&(1<<(i)))
#define nt(a,i) ((a)^(1<<(i)))
#define set1(a,i) ((a)|(1<<(i)))
#define set0(a,i) ((a)&(~(1<<(i))))
#define gret(a,b) (((a)-(b))>eps)
#define less(a,b) (((b)-(a))>eps)
#define greq(a,b) (((a)-(b))>-eps)
#define leeq(a,b) (((b)-(a))>-eps)
#define equl(a,b) (fabs((a)-(b))<eps)
#define lmax(a,b) ((a)>(b)?(a):(b))
#define lmin(a,b) ((a)<(b)?(a):(b))
#define fmax(a,b) (gret(a,b)?(a):(b))
#define fmin(a,b) (less(a,b)?(a):(b))
const int MAXV = 5002;
int n,w,a[MAXV];
#define lc(i) ((i)<<1)
#define rc(i) ((i)<<1|1)
int sum[MAXV<<2],lazy[MAXV<<2];
void up(int i)
{
sum[i]=sum[lc(i)]+sum[rc(i)];
}
void down(int i)
{
lazy[lc(i)]+=lazy[i];
lazy[rc(i)]+=lazy[i];
sum[lc(i)]+=lazy[i];
sum[rc(i)]+=lazy[i];
lazy[i]=0;
}
void change(int x,int y,int w,int l=1,int r=n,int i=1)
{
if(x<=l&&r<=y)
{
sum[i]+=w;
lazy[i]+=w;
}
else
{
if(lazy[i]) down(i);
if(x<=(l+r)/2) change(x,y,w,l,(l+r)/2,lc(i));
if((l+r)/2<y) change(x,y,w,(l+r)/2+1,r,rc(i));
up(i);
}
}
int query(int x,int y,int l=1,int r=n,int i=1)
{
if(x<=l&&r<=y) return sum[i];
else
{
if(lazy[i]) down(i);
int cnt=0;
if(x<=(l+r)/2) cnt+=query(x,y,l,(l+r)/2,lc(i));
if((l+r)/2<y) cnt+=query(x,y,(l+r)/2+1,r,rc(i));
return cnt;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("Minimum Inversion Number.txt","r",stdin);
#endif
while(scanf("%d",&n)!=EOF)
{
memset(sum,0,sizeof(sum));
memset(lazy,0,sizeof(lazy));
int ans=inf,cnt=0;
for(int i=1;n>=i;i++)
{
scanf("%d",&a[i]);
change(a[i]+1,a[i]+1,1);
cnt+=(i-query(1,a[i]+1));
}
ans=min(ans,cnt);
for(int i=1;n>=i;i++)
{
cnt+=(n-a[i]-a[i]-1);
ans=min(ans,cnt);
}
printf("%d\n",ans);
}
return 0;
}