题目大意
随便读题
分析
对有根树T进行DFS,将遍历到的结点按照顺序记下,我们将得到一个长度为2N – 1的序列,称之为T的欧拉序列F
每个结点都在欧拉序列中出现,我们记录结点u在欧拉序列中第一次出现的位置为pos(u)
根据DFS的性质,对于两结点u、v,从pos(u)遍历到pos(v)的过程中经过LCA(u, v)有且仅有一次,且深度是深度序列B[pos(u)…pos(v)]中最小的
即LCA(T, u, v) = RMQ(B, pos(u), pos(v)),并且问题规模仍然是O(N)的
很难看的c++代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
struct arr{
int x,y;
int next;
};
arr edge[42001];
int n,m,nm;
int num;
int d[60001][16];
int f[60001][16];
int p[42001];
int a[62001],b[62001];
int ls[42001];
int v[42001];
int min(int x,int y)
{
if (x>y)
return y;
else
return x;
}
void add(int x,int y)
{
nm++;
edge[nm].x=x;
edge[nm].y=y;
edge[nm].next=ls[x];
ls[x]=nm;
}
void init()
{
memset(ls,0,sizeof(ls));
memset(d,0,sizeof(d));
memset(v,0,sizeof(v));
memset(p,0,sizeof(p));
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
scanf("%d",&n);
for (int i=1;i<=n-1;i++)
{
int a,b;
scanf("%d%d",&a,&b);
add(a,b);
v[b]=1;
}
}
void dp()
{
for (int i=1;i<=num;i++)
{
d[i][0]=a[i];
f[i][0]=b[i];
}
for (int j=1;j<=15;j++)
for (int i=1;i<=num;i++)
{
if (i+(1<<j)-1>num) break;
d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
if (d[i][j]==d[i][j-1])
f[i][j]=f[i][j-1];
else
f[i][j]=f[i+(1<<(j-1))][j-1];
}
}
int dfs(int r,int x,int dep)
{
int i=ls[x];
num++;
p[x]=num;
a[num]=dep;
b[num]=x;
while (i!=0)
{
if (edge[i].y==r)
{
i=edge[i].next;
continue;
}
dfs(x,edge[i].y,dep+1);
num++;
a[num]=dep;
b[num]=x;
i=edge[i].next;
}
}
int main()
{
int t;
scanf("%d",&t);
for (int z=1;z<=t;z++){
init();
num=0;
for (int i=1;i<=n;i++)
if (v[i]==0) dfs(0,i,1);
dp();
for (int i=1;i<=1;i++)
{
int a,b;
scanf("%d%d",&a,&b);
a=p[a];
b=p[b];
if (a>b)
{
int c=a;
a=b;
b=c;
}
int ans;
int k=floor(log(b-a+1)/log(2));
ans=min(d[a][k],d[b-(1<<k)+1][k]);
if (ans==d[a][k])
printf("%d\n",f[a][k]);
else
printf("%d\n",f[b-(1<<k)+1][k]);
}
}
return 0;
}