这个吧,就是这么回事。你把每一个数都插在相应的点上。然后,query来计算a[i]道n的插得点个数,因为你是按顺序插得。先插的而且还在后面。那么一定构成逆序数。然后用sum保存一下。
还有逆序数的计算第一个数放到最后,比他小的有x-1个,比他大的有n-x个。然后给移到后面,逆序数增加n - x -个,比x小的逆序数均减去1.所以逆序数为n - 2 * x - 1个。
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int MaxN = 5010;
struct node{
int l , r , sum;
}tree[MaxN << 2];
void buildT(int l , int r , int rt)
{
tree[rt].l = l;
tree[rt].r = r;
tree[rt].sum = 0;
if(l == r) return;
int m = (l + r) >> 1;
buildT(l , m , rt << 1);
buildT(m + 1 , r , rt << 1 | 1);
}
void update(int add , int rt)
{
if(tree[rt].l == add && tree[rt].r == add){
tree[rt].sum = 1;
return;
}
int mid = (tree[rt].l + tree[rt].r) >> 1;
if(add <= mid) update(add , rt << 1);
else update(add , rt << 1 | 1);
tree[rt].sum = tree[rt << 1].sum + tree[rt << 1 | 1].sum;
}
int query(int rt , int l , int r)
{
if(l <= tree[rt].l && r >= tree[rt].r)
return tree[rt].sum;
else{
int mid = (tree[rt].l + tree[rt].r) / 2;
int sum1 = 0 , sum2 = 0;
if(l <= mid) sum1 = query(rt << 1 , l , r);
if(r > mid) sum2 = query(rt << 1 | 1 , l , r);
return sum1 + sum2;
}
}
int main()
{
int n;
while(~scanf("%d",&n)){
int a[MaxN];
buildT(1 , n , 1);
int ans = 0;
for(int i = 1 ; i <= n ; i++){
scanf("%d",&a[i]);
ans += query(1 , a[i] + 1 , n);
update(a[i],1);
}
int minx = ans;
for(int i = 1 ; i <= n ;i++){
ans = ans + n - 2 * a[i] - 1;
if(ans < minx)
minx = ans;
}
printf("%d\n",minx);
}
return 0;
}