HDU 2689

求逆序对个数，其实就和之前写的那个题差不多，很简单，直接贴代码了。

PS：树状数组可以用来求有大小关系的区间

#include <stdio.h>
#include <iostream>
#include <string.h>

using namespace std;

#define LEN 1001

int tree[LEN+1], in[LEN+1];
int ans[LEN+1];

int lowbit(int x) {
	return x & (-x);
}

void update(int x) {
	while(x <= LEN) {
		tree[x]++;
		x += lowbit(x);
	}
}

int query(int x) {
	int sum = 0;
	while(x > 0) {
		sum += tree[x];
		x -= lowbit(x);
	}
	return sum;
}

int main() {
	int t;
	while(scanf("%d", &t) != EOF) {
		int i, j;
		memset(tree, 0, sizeof(tree));
		for(i = 1; i <= t; i++) {
			scanf("%d", &in[i]);
		}
		int res = 0;
		for(i = 1; i <= t; i++) {
			update(in[i]);
			ans[i] = i - query(in[i]-1) - 1;
			res += ans[i];
		}
		printf("%d\n", res);
	}
	return 0;
}