HDU - 1394（线段树求逆序数）

Minimum Inversion Number HDU - 1394

  输入一个整数n，接下来随意顺序输入0到n-1之间的数，然后可以将序列的第一个数移到最后一位去，形成新的序列。要求你输出这样的操作得到的不同数字串中逆序数的最小个数。可以用线段树来求逆序对。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
const int MAX_N = 5500;
const int inf = 0x3f3f3f3f;
struct node {
	int l, r;
	int sum;
}tr[MAX_N*4];
int n;
int a[MAX_N];
void pushup(int p) {
	tr[p].sum = tr[p << 1].sum + tr[p << 1 | 1].sum;
}

void build(int u, int l, int r) {
	tr[u].l = l, tr[u].r = r;
	if (l == r) {
		tr[u].sum = 0;
		return;
	}
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
	pushup(u);
}

int query(int u, int L, int R) {
	int ans = 0;
	if (tr[u].l >= L && tr[u].r <= R)return tr[u].sum;
	int mid = tr[u].l + tr[u].r >> 1;
	if (L <= mid)ans += query(u << 1, L, R);
	if (R >= mid + 1)ans += query(u << 1 | 1, L, R);
	return ans;
}
void modify(int u, int pos) {
	if (tr[u].l == tr[u].r) { 
		tr[u].sum++; 
		return;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	if (pos <= mid)modify(u << 1, pos);
	else modify(u << 1 | 1, pos);
	pushup(u);
}


int main() {
	while (scanf("%d", &n) != EOF) {
		build(1, 1, n);
		int ans = 0;
		int minn = inf;
		for (int i = 1; i <= n;i++) {
			scanf("%d", &a[i]);
			a[i]++;
			ans += query(1, a[i] + 1, n);
			modify(1, a[i]);
		}
		if (ans < minn)minn = ans;
		for (int i = 1; i < n; i++)
		{
			ans = ans + (n - a[i] + 1) - a[i];
			if (minn > ans) minn = ans;
		}
		printf("%d\n", minn);
	}
	return 0;
}