P1908 逆序对(线段树+离散化）（应该也算是权值线段树了吧）

思路：讲数组arr离散化后再加入线段树tree中，tree[arr[i]]++；意思是数组在线段树中的位置加一，然后统计arr[i]+1到n的和，就是到目前i的逆序对数目。

#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define Max 500010
#define mod 1000000007
using namespace std;
ll n, tree[Max << 2], arr[Max], tem[Max], ans;
void pushup(int rt) {
    tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];
}
void update(int L, int l, int r, int rt) {
    if(l == r) {
        tree[rt]++;
        return;
    }
    int m = (l + r) >> 1;
    if(m >= L)
        update(L, l, m, rt << 1);
    else
        update(L, m + 1, r, rt << 1 | 1);
    pushup(rt);
}
ll query(int L, int R, int l, int r, int rt) {
    if(L <= l && r <= R) {
        return tree[rt];
    }
    int m = (r + l) >> 1;
    ll ans = 0;
    if(L <= m)
        ans += query(L, R, l, m, rt << 1);
    if(R > m)
        ans += query(L, R, m + 1, r, rt << 1 | 1);
    return ans;
}
int main() {
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> arr[i], tem[i] = arr[i];
    sort(tem + 1, tem + n + 1);
    int num = unique(tem + 1, tem + n + 1) - tem - 1;
    for(int i = 1; i <= n; i++)
        arr[i] = lower_bound(tem + 1, tem + num + 1, arr[i]) - tem;
    for(int i = 1; i <= n; i++) {
        update(arr[i], 1, n, 1);
        ans += query(arr[i] + 1, n, 1, n, 1);//一直把arr[i]写成i，wa了一个小时，难受
    }
    cout << ans;
    return 0;
}