BZOJ 2588 LCA + 主席树

简略题意：树上路径第K大。

经典的LCA + 主席树问题。每次以父亲节点为上一版本建树，对于一次询问的答案就是在区间$x - lca[x, y] + y - fa[lca[x, y]]$的答案。

A了这题可以看一下加强版。

#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;

const int maxn = 110000;

int n, m;
int ans = 0;
int val[maxn];
int root[maxn];
int cid = 0;
struct Seg { int l, r, sum;} tr[maxn*40];

vector<int> V;

int getid(int x) {
    return lower_bound(all(V), x) - V.begin() + 1;
}

int getval(int x) {
    return V[x-1];
}

void update(int &x, int y, int l, int r, int pos, int val) {
    int pre = x;
    x = ++cid; tr[x] = pre? tr[pre]:tr[y]; tr[x].sum += val;
    if(l == r) return ;
    int m = l + r >> 1;
    if(pos <= m) update(tr[x].l, tr[y].l, l, m, pos, val);
    else update(tr[x].r, tr[y].r, m+1, r, pos, val);
}

int ask(int x, int f, int y, int f2, int l, int r, int k) {
    if(l == r) return l;
    int cnt = tr[tr[x].l].sum - tr[tr[f].l].sum + tr[tr[y].l].sum - tr[tr[f2].l].sum;
    int m = l + r >> 1;
    if(cnt >= k) return ask(tr[x].l, tr[f].l, tr[y].l, tr[f2].l, l, m, k);
    else return ask(tr[x].r, tr[f].r, tr[y].r, tr[f2].r, m+1, r, k - cnt);
}

int p[maxn][20], deep[maxn];
vector<int> G[maxn];
vector<int> C;

void dfs(int u, int fa) {
    C.push_back(u);
    p[u][0] = fa;
    deep[u] = deep[fa] + 1;
    update(root[u], root[fa], 1, n, getid(val[u]), 1);
    for(int i = 0; i < G[u].size(); i++) {
        int v = G[u][i];
        if(v == fa) continue;
        dfs(v, u);
    }
}

void change() {
    for(int i = 1; i < 20; i++) {
        for(int j = 0; j < C.size(); j++) {
            int u = C[j];
            if(p[u][i-1] == 0) p[u][i] = 0;
            else p[u][i] = p[p[u][i-1]][i-1];
        }
    }
    C.clear();
}

int goup(int x, int len) {
    for(int i = 0; i < 20; i++) {
        if(len & (1 << i) && x != 0)
            x = p[x][i];
    }
    return x;
}

int lca(int x, int y) {
    if(deep[x] < deep[y]) swap(x, y);
    int d = deep[x] - deep[y];
    x = goup(x, d);
    if(x == y) return x;
    for(int i = 19; i >= 0; i--) {
        if(p[x][i] == p[y][i])
            continue;
        x = p[x][i];
        y = p[y][i];
    }
    return p[x][0];
}

int main() {
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%d", &val[i]), V.push_back(val[i]);
    sort(all(V));
    V.erase(unique(all(V)), V.end());
    for(int i = 1; i < n; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    deep[0] = 0;
    dfs(1, 0);
    change();
    for(int i = 1; i <= m; i++) {
        int x, y, k, lc;
        scanf("%d%d%d", &x, &y, &k);
        x ^= ans;
        lc = lca(x, y);
        if(i == m)
            printf("%d", ans = getval(ask(root[x], root[lc], root[y], root[p[lc][0]], 1, n, k)));
        else
            printf("%d\n", ans = getval(ask(root[x], root[lc], root[y], root[p[lc][0]], 1, n, k)));
    }
    return 0;
}