链接、
树剖,(在线)
#include<bits/stdc++.h>
using namespace std;
const int maxn = 5e5+7;
int n,m,s;
int tot,son[maxn],id[maxn],fa[maxn],dep[maxn],siz[maxn],top[maxn];
int head[maxn],to[maxn<<1],nex[maxn<<1],cnt = 1;
void add(int u,int v){to[cnt] = v,nex[cnt] = head[u];head[u] = cnt++;}
void dfs1(int u,int Fa,int deep){
dep[u] = deep,fa[u] = Fa,siz[u] = 1;
int maxnson = -1;
for(int i=head[u];i;i=nex[i]){
int y = to[i];
if(y == Fa)continue;
dfs1(y,u,deep+1);
siz[u] += siz[y];
if(siz[y] > maxnson)
son[u] = to[i],maxnson = siz[y];
}
}
void dfs2(int u,int tp){
id[u] = ++tot;
top[u] = tp;
if(!son[u])return;
dfs2(son[u],tp);
for(int i=head[u];i;i=nex[i]){
if(to[i] == fa[u] || to[i] == son[u])continue;
dfs2(to[i],to[i]);//轻儿子有自己的想法
}
}
int query(int x,int y){
while(top[x]!=top[y]){
if(dep[top[x]]<dep[top[y]])swap(x,y);
x = fa[top[x]];
}
if(dep[x]>dep[y])swap(x,y);
return x;
}
int main(){
scanf("%d%d%d",&n,&m,&s);
for(int i=1,x,y;i<n;i++)
scanf("%d%d",&x,&y),add(x,y),add(y,x);
dfs1(s,s,1);
dfs2(s,s);
for(int i=1,x,y;i<=m;i++){
scanf("%d%d",&x,&y);
printf("%d\n",query(x,y));
}
return 0;
}
tarjan,(离线)链接、
倍增,(在线)链接、