题目传送门
这里推荐一篇带图的讲解链接会讲的更详细一些。
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
//#define int long long
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define ull unsigned long long
#define pqi priority_queue<int>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read(){
int x=0,f=1; char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=gc();}
return x*f;
}
using namespace std;
const int N=1e6+5;
const int inf=0x7fffffff;
const int mod=1e9+7;
const double eps=1e-6;
int head[N],nxt[N],to[N],tot=0;
void add(int u,int v)//建边
{
nxt[++tot]=head[u];
to[tot]=v;
head[u]=tot;
}
int deep[N],a[N],node[N],f[N],cnt=0;
void dfs(int x,int y)
{
deep[x]=deep[y]-(x==y)+1;
a[++cnt]=deep[x];node[cnt]=x;
if(!f[x])
f[x]=cnt;
for(int i=head[x];i;i=nxt[i])
{
if(to[i]!=y)
{
dfs(to[i],x);
a[++cnt]=deep[x];node[cnt]=x;
}
}
}
int st[N][21],num[N][21],lg[N];
signed main()
{
int n,m,s;
n=read();m=read();s=read();
for(int i=1;i<=n-1;i++)
{
int x,y;
x=read();y=read();
add(x,y);
add(y,x);
}
dfs(s,s);
for(int i=1;i<=cnt;i++)
{
st[i][0]=a[i];
num[i][0]=i;
}
for(int j=1;(1<<j)<=cnt;j++)
{
for(int i=1;i+(1<<(j-1))<=cnt;i++)
{
st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
if(st[i][j-1]<st[i+(1<<(j-1))][j-1])
num[i][j]=num[i][j-1];
else
num[i][j]=num[i+(1<<(j-1))][j-1];
}
}
for(int i=2;i<=cnt;i++)
{
lg[i]=lg[i>>1]+1;
}
while(m--)
{
int a,b;
a=read();b=read();
int xx=f[a],yy=f[b];
if(xx>yy)
swap(xx,yy);
int k=lg[yy-xx+1];
if(st[xx][k]<st[yy-(1<<k)+1][k])
printf("%d\n",node[num[xx][k]]);
else
printf("%d\n",node[num[yy-(1<<k)+1][k]]);
}
}