权值线段树

权值线段树简单的来说就是叶子节点保存的是数的个数
就拿求逆序对来说每个点的插入顺序决定了在次之前数轴上比它小的个数（此时左边数的个数）和比他大的个数（此时右边数的个数）
这里我们的权值线段树就是维护每个数个数（可理解为权值）多少逆序对即查询此时右边有多少数
P1908 逆序对

#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
    auto tmp = { (cout << args << ' ', 0)... };
    cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
struct node {
    int l, r;
    int cnt;
}tree[N<<2];
void push_up(int root) {
    tree[root].cnt = tree[root << 1].cnt + tree[root << 1 | 1].cnt;
}
void build(int root,int l,int r) {
    if (l == r) tree[root] = { l,r,0 };
    else {
        tree[root] = { l,r };
        int mid = l + r >> 1;
        build(root << 1, l, mid);
        build(root << 1 | 1, mid + 1, r);
        push_up(root);
    }
    
}
void modify(int root, int pos) {
    if (tree[root].l == tree[root].r && tree[root].l == pos) {
        tree[root].cnt++;
        return;
    }
    int mid = tree[root].l + tree[root].r >> 1;
    if(pos<=mid)modify(root << 1, pos);
    if(pos>mid)modify(root << 1 | 1, pos);
    push_up(root);
    
}
ll query(int root, int l, int r) {
    if (l <=tree[root].l  && tree[root].r <= r)return tree[root].cnt;
    int mid = tree[root].l + tree[root].r >> 1;
    if (r <= mid)return query(root << 1, l, r);
    else if (l > mid)return query(root << 1 | 1, l, r);
    else {
        ll left = query(root << 1, l, r);
        ll right = query(root << 1 | 1, l, r);
        ll ans;
        ans = left + right;
        return ans;
    }
}
vector<int>a;
int getid(int val) {
    return lower_bound(a.begin(), a.end(), val) - a.begin() + 1;
}
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    vector<int> b;
    for (int i = 0; i < n; i++){
        int t;
        cin >> t;
        a.push_back(t);
        b.push_back(t);
    }
    sort(a.begin(), a.end());
    a.erase(unique(a.begin(), a.end()), a.end());
    build(1, 1, a.size()+1);
    ll ans = 0;
    for (auto i : b) {
        int id = getid(i);
        modify(1,id);
        ans += query(1, id+1, a.size()+1);
    }
    cout << ans << "\n";

    return 0;
}