LCA--最近公共祖先模板

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=1e4;
struct Node{
    int v,next;
}edge[N<< 1]; 
int head[N],cnt;

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

int depth[N], fa[N][22], lg[N];

void dfs(int now, int fath) {
    fa[now][0] = fath; 
	depth[now] = depth[fath] + 1;
	
    for(int i = 1; i <= lg[depth[now]]; ++i)
        fa[now][i] = fa[fa[now][i-1]][i-1];
    
	for(int i = head[now]; i!=-1; i = edge[i].next)
        if(edge[i].v != fath) dfs(edge[i].v, now);
}

int LCA(int x, int y) {
    if(depth[x] < depth[y]) 
	swap(x, y);
	
    while(depth[x] > depth[y])
        x = fa[x][lg[depth[x]-depth[y]] - 1];
        
    if(x == y) return x;
    
    for(int k = lg[depth[x]] - 1; k >= 0; --k)
        if(fa[x][k] != fa[y][k])
            x = fa[x][k], y = fa[y][k];
    
    return fa[x][0];
}
int main() {
	//树的节点数目为n,查询次数为m,根节点为s 
    int n, m, s;
	scanf("%d%d%d", &n,&m,&s);
	memset(head,-1,sizeof(head));
	cnt=0;
	for(int i=1;i<n;i++)
	{
		int u,v;
		scanf("%d%d",&u,&v);
		add_edge(u,v);
		add_edge(v,u); 
	}
	
    for(int i = 1; i <= n; ++i)
        lg[i] = lg[i-1] + (1 << lg[i-1] == i);
    dfs(s, 0);
    
    for(int i = 1; i <= m; ++i) 
	{
        int x, y; scanf("%d%d",&x, &y);
        printf("%d\n", LCA(x, y));
    }
    return 0;
}