【NOIP模板】 树链剖分 （求lca）

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct Edge {
    int v, next;
} edge[20050];

int T, n, a, b, num, head[20050];

int fa[10050], son[10050], siz[10050], vis[10050], dep[10050], top[10050];

void zero() {
    num = 0;
    memset(fa, 0, sizeof(fa));
    memset(son, -1, sizeof(son));
    memset(vis, 0, sizeof(vis));
    memset(siz, 0, sizeof(siz));
    memset(dep, 0, sizeof(dep));
    memset(head, 0, sizeof(head));
}

void add(int u, int v) {
    num ++;
    edge[num].v = v;
    edge[num].next = head[u];
    head[u] = num;
}

void dfs1(int u, int f, int d) {
    fa[u] = f, siz[u] = 1, dep[u] = d;
    for(int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        if(v == f) continue;
        dfs1(v, u, d + 1);
        siz[u] += siz[v];
        if(son[u] == -1 || siz[v] > siz[son[u]])
            son[u] = v;
    }
}

void dfs2(int u, int tp) {
    top[u] = tp;
    if(son[u] == -1) return ;
    dfs2(son[u], tp);
    for(int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        if(v == fa[u] || v == son[u]) continue;
        dfs2(v, v);
    }
}

int query(int a, int b) {
    while(1) {
        if(top[a] == top[b]) {
            if(dep[a] < dep[b]) return a;
            return b;
        }
        else if(dep[top[a]] >= dep[top[b]])
            a = fa[top[a]];
        else b = fa[top[b]];
    }
}

int main() {
    scanf("%d", &T);
    while(T --) {
        zero();
        scanf("%d", &n);
        for(int i = 1; i < n; i ++) {
            int u, v;
            scanf("%d %d", &u, &v);
            vis[v] = 1;
            add(u, v);
            add(v, u);
        }
        int r;
        for(int i = 1; i <= n; i ++)
            if(! vis[i]) r = i;
        scanf("%d %d", &a, &b);
        dfs1(r, 0, 1); dfs2(r, 1);
        printf("%d\n", query(a, b));
    }
    return 0;
}