发现 a[i] >= j 对应的j的区间是 1 -- min(i-1, a[i])
于是转换为求这个区间内, a[j] >= i 的个数, 于是主席树就可以了
#include<bits/stdc++.h>
#define N 200050
using namespace std;
int rt[N]; struct Node{int ls, rs, sum;}t[N * 40];
int n, a[N], tot;
typedef long long ll; ll ans;
void Build(int &x, int l, int r){
x = ++tot; if(l == r) return; int mid = (l+r) >> 1;
Build(t[x].ls, l, mid); Build(t[x].rs, mid+1, r);
}
void Insert(int last, int &x, int l, int r, int pos){
x = ++tot; t[x] = t[last]; t[x].sum++; if(l == r) return;
int mid = (l+r) >> 1;
if(pos <= mid) Insert(t[last].ls, t[x].ls, l, mid, pos);
else Insert(t[last].rs, t[x].rs, mid+1, r, pos);
}
int Quary(int x, int l, int r, int L, int R){
if(L<=l && r<=R) return t[x].sum; int mid = (l+r) >> 1, ans = 0;
if(L<=mid) ans += Quary(t[x].ls, l, mid, L, R);
if(R>mid) ans += Quary(t[x].rs, mid+1, r, L, R); return ans;
}
int main(){
scanf("%d", &n); Build(rt[0], 1, n);
for(int i=1; i<=n; i++){
scanf("%d", &a[i]), a[i] = min(a[i], n);
ans += (ll)Quary(rt[min(i-1, a[i])], 1, n, i, n);
Insert(rt[i-1], rt[i], 1, n, a[i]);
} printf("%lld", ans); return 0;
}