HDU 6162 主席树+LCA（树上求区间[a,b]中的个数）

题意：

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6162
给出一棵树，每个结点有一个权值，然后给出若干询问，针对询问区间(u,v,L,R)，求在结点u和v的路径上，权值大小在[L,R]中的结点权值总和是多少。

---

思路：

其实思路和SPOJ COT差不多，传送门：http://blog.csdn.net/bahuia/article/details/77509552
都是针对树上的操作，建立主席树的过程基本一样，在查询的时候同样要考虑u，v，lca(u,v)，pa[lca(u,v)]这4棵树。
唯一的区别是维护的东西不同，只要把线段树找第k大改成找到区间[A,B]内的和即可。
注意trick，询问的L,R区间同样要离散化，但是要离散化的结果[LB,RB]一定要保证属于[L,R]。

---

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 10;

struct node {
    int ls, rs;
    LL sum;
} ns[MAXN * 20];

int ct, rt[MAXN * 20];

void cpy(int& now, int old) {
    now = ++ct;
    ns[now] = ns[old];
}

void build(int& now, int l, int r) {
    now = ++ct;
    ns[now].sum = 0;
    if (l == r) return;
    int m = (l + r) >> 1;
    build(ns[now].ls, l, m);
    build(ns[now].rs, m + 1, r);
}

void update(int& now, int old, int l, int r, int x, int y) {
    cpy(now, old);
    if (l == r) {
        ns[now].sum += y;
        return;
    }
    int m = (l + r) >> 1;
    if (x <= m) update(ns[now].ls, ns[old].ls, l, m, x, y);
    else update(ns[now].rs, ns[old].rs, m + 1, r, x, y);
    ns[now].sum = ns[ns[now].ls].sum + ns[ns[now].rs].sum;
}

LL query(int s, int t, int lca, int flca, int L, int R, int l, int r) {
    if (L <= l && r <= R) return ns[s].sum + ns[t].sum - ns[lca].sum - ns[flca].sum;;
    int m = (l + r) >> 1;
    //cout << ns[ns[s].ls].sum << " " << ns[ns[t].ls].sum << " " << ns[ns[lca].ls].sum << " " << ns[ns[flca].ls].sum <<endl;
    //cout << s << ", " << t << ", " << lca << ", " << flca << ", " << " cnt = " << cnt << ", " << l << ", " << r << ", " << k << endl;
    LL res = 0;
    if (L <= m) res += query(ns[s].ls, ns[t].ls, ns[lca].ls, ns[flca].ls, L, R, l, m);
    if (R > m) res += query(ns[s].rs, ns[t].rs, ns[lca].rs, ns[flca].rs, L, R, m + 1, r);
    return res;
}

int dfs_cnt, sz;
int pa[MAXN], dp[2 * MAXN][20], fir[2 * MAXN], ver[2 * MAXN], R[2 * MAXN];
int a[MAXN], b[MAXN];
vector <int> tree[MAXN];

void dfs(int u, int fa, int deep) {
    pa[u] = fa;
    fir[u] = ++dfs_cnt;
    ver[dfs_cnt] = u; R[dfs_cnt] = deep;

    update(rt[u], rt[fa], 1, sz, lower_bound(b + 1, b + 1 + sz, a[u]) - b, a[u]);

    for (int i = 0; i < (int)tree[u].size(); i++) {
        int v = tree[u][i];
        if (v == fa) continue;
        dfs(v, u, deep + 1);
        ver[++dfs_cnt] = u; R[dfs_cnt] = deep;
    }
}

void ST(int n) {
    for (int i = 1; i <= n; i++) dp[i][0] = i;
    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 1; i + (1 << j) - 1 <= n; i++) {
            int x = dp[i][j - 1], y = dp[i + (1 << (j - 1))][j - 1];
            dp[i][j] = R[x] < R[y] ? x : y;
        }
    }
}

int RMQ(int l, int r) {
    int k = 0;
    while ((1 << (k + 1)) <= r - l + 1) ++k;
    int x = dp[l][k], y = dp[r - (1 << k) + 1][k];
    return R[x] < R[y] ? x : y;
}

int LCA(int u, int v) {
    int x = fir[u], y = fir[v];
    if (x > y) swap(x, y);
    return ver[RMQ(x, y)];
}

int main() {
    //freopen("in.txt", "r", stdin);
    int n, m;
    while (scanf("%d%d", &n, &m) == 2) {
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            b[i] = a[i];
        }
        sort (b + 1, b + 1 + n);
        sz = unique(b + 1, b + 1 + n) - b - 1;

        for (int i = 1; i <= n; i++) tree[i].clear();
        for (int i = 1; i < n; i++) {
            int u, v;
            scanf("%d%d", &u, &v);
            tree[u].push_back(v);
            tree[v].push_back(u);
        }
        ct = dfs_cnt = 0;
        build(rt[0], 1, sz);
        dfs(1, 0, 1);
        ST(2 * n - 1);
        /*for (int i = 0; i <= 5 * n; i++) {
                printf("%d, rt = %d, ls = %d, rs = %d, sum = %d\n", i, rt[i], ns[rt[i]].ls, ns[rt[i]].rs, ns[rt[i]].sum);
            }*/

        while (m--) {
            int s, t, L, R;
            scanf("%d%d%d%d", &s, &t, &L, &R);
            int lca = LCA(s, t), flca = pa[lca];
            int LB = lower_bound(b + 1, b + 1 + sz, L) - b;
            int RB = lower_bound(b + 1, b + 1 + sz, R) - b;
            LL ans = 0;
            if (b[LB] < L) ++LB;
            if (RB > sz || b[RB] > R) --RB;
            if (LB > RB) ans = 0;
            else ans = query(rt[s], rt[t], rt[lca], rt[flca], LB, RB, 1, sz);
            //cout << s << " " << t << " " << lca << " " << flca << endl;
            printf("%I64d%c", ans, m == 0 ? '\n' : ' ');
        }
    }
    return 0;
}