[bzoj 4756][Usaco2017 Jan]Promotion Counting 线段树合并

今天考了雕哥的模拟赛才知道线段树合并这种东西…
从来没打过的我直接学了一发…mmp merge没return一直Re

其实这个东西说起来也不难 大概就是动态开点的线段树 把信息合并起来就差不多了
当然这两棵线段树形态一点要相同 剩下的其实就差不多了
题目链接

#include<bits/stdc++.h>
#define For(i, a, b) for(register int i = a; i <= b; ++ i)

using namespace std;

const int maxn = 1e5 + 10;
int n, num, ans[maxn], root[maxn], tmp[maxn], a[maxn], dep[maxn];
vector<int> son[maxn];

struct Segment_Tree {
#define ls(x) (T[x].ch[0])
#define rs(x) (T[x].ch[1])
#define mid ((l + r) >> 1)
    int cnt;

    struct node {
        int sum, ch[2];
    }T[maxn * 80];

    void pushup(int x) {
        T[x].sum = T[ls(x)].sum + T[rs(x)].sum;
    }

    void update(int &x, int l, int r, int p) {
        if(!x) x = ++ cnt;
        if(l == r) ++ T[x].sum;
        else {
            if(p <= mid) update(ls(x), l, mid, p);
            else update(rs(x), mid + 1, r, p);
            pushup(x);
        }
    }

    int query(int x, int l, int r, int X, int Y) {
        if(!x) return x;
        int res = 0;
        if(X <= l && r <= Y) 
            res += T[x].sum;
        else {
            if(X <= mid) res += query(ls(x), l, mid, X, Y);
            if(Y > mid) res += query(rs(x), mid + 1, r, X, Y);
        }
        return res;
    }

    int merge(int u, int v) {
        if(!u) return v;
        if(!v) return u;
        int t = ++ cnt;
        T[t].sum = T[u].sum + T[v].sum;
        ls(t) = merge(ls(u), ls(v));
        rs(t) = merge(rs(u), rs(v));
        return t;
    }

}T;

void dfs(int x) {
    T.update(root[x], 1, num, a[x]);
    For(i, 0, int(son[x].size()) - 1)
    {
        dfs(son[x][i]);
        root[x] = T.merge(root[x], root[son[x][i]]);
    }
    ans[x] = T.query(root[x], 1, num, a[x] + 1, num);
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("4756.in", "r", stdin);
    freopen("4756.out", "w", stdout);
#endif
    int x; scanf("%d", &n);
    For(i, 1, n) scanf("%d", &a[i]), tmp[i] = a[i];
    sort(tmp + 1, tmp + n + 1);
    num = unique(tmp + 1, tmp + n + 1) - tmp - 1;
    For(i, 1, n) 
        a[i] = lower_bound(tmp + 1, tmp + num + 1, a[i]) - tmp;
    For(i, 2, n) {
        scanf("%d", &x);
        son[x].push_back(i);
    }
    dfs(dep[1] = 1);
    For(i, 1, n) printf("%d\n", ans[i]);
    return 0;
}