// 线段树模板 区间加 void solve() { int n; cin >> n; vector<int> a(n + 1); for (int i = 1; i <= n; i++) cin >> a[i]; auto b = a; std::sort(b.begin(), b.end()); SegTree seg(n); for (int i = 1; i <= n; i++) { int x = b.end() - std::upper_bound(b.begin(), b.end(), a[i]); seg.modify(1, 1...