知识点:线段树
这个题一般都是用树状数组做的,但是还没学,现在在学线段树,就用来练习线段树把,就是很一般的权值线段树,难度是洛谷绿题,洛谷有和这个一模一样的题
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct tree {
int l, r;
int num;
};
int a[N], b[N], c[N], L[N], R[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].num = 0; return; }
int mid = (l + r) / 2;
build(p * 2, l, mid);
build(p * 2 + 1, mid + 1, r);
t[p].num = t[p * 2].num + t[p * 2 + 1].num;
}
void update(int p, int x) {
if (t[p].l == t[p].r) { t[p].num++; return; }
int mid = (t[p].l + t[p].r) / 2;
if (x <= mid) update(p * 2, x);
else update(p * 2 + 1, x);
t[p].num = t[p * 2].num + t[p * 2 + 1].num;
}
int query(int p, int l, int r) {
if (l <= t[p].l && r >= t[p].r) return t[p].num;
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]);
c[i] = a[i];
}
sort(a + 1, a + n + 1);
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (i == 1 || (i > 1 && a[i] > a[i - 1])) b[++cnt] = a[i];
}
for (int i = 1; i <= n; i++) {
a[i] = lower_bound(b + 1, b + cnt + 1, c[i]) - b;
}
build(1, 1, cnt);
for (int i = 1; i <= n; i++) {
update(1, a[i]);
if (a[i] == cnt) continue;
L[i] = query(1, a[i] + 1, cnt);
}
build(1, 1, cnt);
for (int i = n; i >= 1; i--) {
update(1, a[i]);
if (a[i] == 1) continue;
R[i] = query(1, 1, a[i] - 1);
}
long long ans = 0;
for (int i = 1; i <= n; i++) {
ans += (long long) L[i] * R[i];
}
cout << ans;
return 0;
}