P1908 逆序对（离散化+树状数组）

P1908 逆序对https://www.luogu.com.cn/problem/P1908

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

struct node {
	ll num, tre;
} tree[MAXN];

ll ans[MAXN];
ll now[MAXN];
ll change[MAXN];
ll n, rec;
inline bool cmp(node a, node b) {
	if (a.tre == b.tre) {
		return a.num < b.num;
	}
	return a.tre < b.tre;
}

inline void update(ll pos, ll x) {
	for (; pos <= n; pos += lowbit(pos)) {
		ans[pos] += x;
	}
}

inline ll query(ll num) {
	ll res = 0;
	for (; num; num -= lowbit(num)) {
		res += ans[num];
	}
	return res;
}

int main() {
	scanf("%lld", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", &tree[i].tre);
		tree[i].num = i;
	}
	sort(tree + 1, tree + n + 1, cmp);
	for (int i = 1; i <= n; i++) {
		change[tree[i].num] = i;
	}
	for (int i = 1; i <= n; i++) {
		update(change[i], 1);
		rec += i - query(change[i]);
	}
	printf("%lld", rec);
	return 0;
}