P3379 【模板】最近公共祖先（LCA）(2) ST表法

输入 #1复制

5 5 4
3 1
2 4
5 1
1 4
2 4
3 2
3 5
1 2
4 5

输出 #1复制

4
4
1
4
4

对其进行欧拉排序取区间最小深度

#include<bits/stdc++.h>
const int maxn = 5e5 + 10;
int n, m, s;
int cnt;
int tot;
int head[maxn];
int depth[maxn * 2];
int order[maxn * 2];
int st[maxn * 2][20];
int fp[maxn * 2];
int lg[maxn * 2];
using namespace std;

struct node{
	int to;
	int next;
	node() {}
	node(int a, int b) : to(a), next(b) {}
}edge[maxn * 2];

void edgeadd(int a, int b){
	edge[tot] = node(b, head[a]); 
	head[a] = tot++;
	edge[tot] = node(a, head[b]);
	head[b] = tot++;
}

void init(){
	memset(head, -1, sizeof(head));
	memset(depth, 0, sizeof(depth));
	memset(order, 0, sizeof(order));
	memset(st, 0, sizeof(st));
	memset(fp, 0, sizeof(fp));
	tot = 0;
	cnt = 0;	
}

void dfs(int nw, int dpt){
	++cnt;
	fp[nw] = cnt;
	order[cnt] = nw;
	depth[cnt] = dpt + 1;
	for(int i = head[nw]; i != -1; i = edge[i].next){
		int v = edge[i].to;
		if(!fp[v]){
			dfs(v, dpt + 1);
			++cnt;
			order[cnt] = nw;
			depth[cnt] = dpt + 1;		
		}
	}
}
void ST_init(){
	for(int i = 1; i <= cnt; i++)
		st[i][0] = i;
	int k = lg[cnt];
	for(int j = 1; j <= k; j++){
		for(int i = 1; i + (1 << j) - 1 <= cnt; i++){
			int a = st[i][j - 1];
			int b = st[i + (1 << (j - 1))][j - 1];
			if(depth[a] < depth[b])
				st[i][j] = a;
			else
				st[i][j] = b;
		}
	}
}

int main(){
	scanf("%d%d%d",&n,&m,&s);
	init();
	lg[0] = -1;
	for(int i = 1; i <= maxn * 2; i++)
		lg[i] = lg[i >> 1] + 1;
	for(int i = 1; i <= n - 1; i++){
		int a, b;
		scanf("%d%d",&a,&b);
		edgeadd(a, b);
	}
	dfs(s, 0);
	ST_init();
	for(int i = 1; i <= m; i++){
		int l, r;
		scanf("%d%d",&l,&r);
		int a = fp[l];
		int b = fp[r];
		if(a > b)
			swap(a, b);
		int k = lg[b - a];
		int x = st[a][k];
		int y = st[b - (1 << k) + 1][k];
		if(depth[x] < depth[y])
			printf("%d\n",order[x]);
		else
			printf("%d\n",order[y]);
	}
}