AcWing 241. 楼兰图腾

知识点：线段树

树状数组还没有学，先用线段树来写，是权值线段树的最基本的应用

#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

struct tree {
	int l, r;
	int cnt;
};

int a[N], b[N], c[N], d[N], e[N];
tree t[N * 4];

void build(int p, int l, int r) {
	t[p].l = l; t[p].r = r;
	if (l == r) { t[p].cnt = 0; return; }
	int mid = (l + r) / 2;
	build(p * 2, l, mid);
	build(p * 2 + 1, mid + 1, r);
	t[p].cnt = t[p * 2].cnt + t[p * 2 + 1].cnt;
}

void update(int p, int index) {
	if (t[p].l == t[p].r) { t[p].cnt = 1; return; }
	int mid = (t[p].l + t[p].r) / 2;
	if (index <= mid) update(p * 2, index);
	else update(p * 2 + 1, index);
	t[p].cnt = t[p * 2].cnt + t[p * 2 + 1].cnt;
}

int query(int p, int l, int r) {
	if (l <= t[p].l && r >= t[p].r) return t[p].cnt;
	int mid = (t[p].l + t[p].r) / 2;
	int val = 0;
	if (l <= mid) val += query(p * 2, l, r);
	if (r > mid) val += query(p * 2 + 1, l, r);
	return val;
}

int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	build(1, 1, n);
	for (int i = 1; i <= n; i++) {
		update(1, a[i]);
		if (a[i] > 1) b[i] = query(1, 1, a[i] - 1);
		if (a[i] < n) c[i] = query(1, a[i] + 1, n);
	}
	build(1, 1, n);
	for (int i = n; i >= 1; i--) {
		update(1, a[i]);
		if (a[i] > 1) d[i] = query(1, 1, a[i] - 1);
		if (a[i] < n) e[i] = query(1, a[i] + 1, n);
	}
	long long ans1 = 0, ans2 = 0;
	for (int i = 1; i <= n; i++) {
		ans1 += (long long) c[i] * e[i];
		ans2 += (long long) b[i] * d[i];
	}
	cout << ans1 << ' ' << ans2;
	return 0;
}