Pagini recente » Cod sursa (job #1553753) | Cod sursa (job #1958385) | Cod sursa (job #1853999) | Cod sursa (job #823683) | Cod sursa (job #639952)
Cod sursa(job #639952)
#include<cstdio>
#include<vector>
using namespace std;
int N,M;
vector<int> nr[100010];
int rmq[18][200010],lg[200010],papar[100010];
int neu[200010],heu[200010],euler;
char viz[200010];
inline int minim(int a,int b){
if(heu[a]<=heu[b])
return a;
return b;
}
void df(int x,int H){
viz[x]=1;
heu[++euler]=H;
neu[euler]=x;
papar[x]=euler;
for(vector<int>::iterator it=nr[x].begin();it!=nr[x].end();++it){
if(!viz[*it]){
df(*it,H+1);
heu[++euler]=H;
neu[euler]=x;
}
}
}
int main(){
freopen("lca.in","r",stdin);
freopen("lca.out","w",stdout);
int i,j,x,y,L;
scanf("%d%d",&N,&M);
for(i=2;i<=N;++i){
scanf("%d",&x);
nr[x].push_back(i);
}
df(1,0);
for(i=1;i<=euler;++i){
// printf("%3d",i);
rmq[0][i]=i;
}
for(i=2;i<=euler;++i)
lg[i]=lg[i>>1]+1;
/* printf("\n");
for(i=1;i<=euler;++i)
printf("%3d",heu[i]);
printf("\n");
for(i=1;i<=euler;++i)
printf("%3d",neu[i]);
printf("\n\n");
for(i=1;i<=euler;++i)
printf("%3d",rmq[0][i]);
printf("\n");*/
for(i=1;(1<<i)<=(N<<1)-1;++i){
for(j=1;j<=(N<<1)-(1<<i);++j){
rmq[i][j]=minim(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
// printf("%3d",rmq[i][j]);
}
// printf("\n");
}
/* for(i=1;i<=N;++i){
printf("%d = %d\n",i,papar[i]);
}
printf("\n\n\n");*/
for(i=0;i<M;++i){
scanf("%d%d",&x,&y);
// printf("%d - %d %d - %d\n",x,papar[x],y,papar[y]);
x=papar[x];
y=papar[y];
if(y<x){
j=x;
x=y;
y=j;
}
L=lg[y-x+1];
// printf("L=%d %d %d\n",L,rmq[L][x],rmq[L][y+1-(1<<L)]);
L=minim(rmq[L][x],rmq[L][y+1-(1<<L)]);
printf("%d\n",neu[L]);
}
fclose(stdin);
fclose(stdout);
return 0;
}