Pagini recente » Cod sursa (job #1014140) | Cod sursa (job #1646123) | Cod sursa (job #1889671) | Cod sursa (job #3134932) | Cod sursa (job #528713)
Cod sursa(job #528713)
#include<iostream.h>
#include<fstream.h>
#define N 100001
long n,m,a[N],x,y,i,j,p[N][20],l[N];
void init(long n,long a[N],long p[N][20])
{long i,j;
for(i=0;i<=n;i++)
{for(j=1;j<=18;j++)
p[i][j]=-1;}
for(i=1;i<=n;i++)
p[i][0]=a[i];
for(j=1;j<=18;j++)
{for(i=0;i<=n;i++)
if(p[i][j-1]!=-1)
p[i][j]=p[p[i][j-1]][j-1];}}
long lca(long n,long p[N][20],long a[N],long l[N],long x,long y)
{long i,tmp,log;
if(l[x]<l[y])
{tmp=x;
x=y;
y=tmp;}
for(log=1;(1<<log)<=l[x];log++);
log--;
for(i=log;i>=0;i--)
if(l[x]-(1<<i)>=l[y])
x=p[x][i];
if(x==y)
return x;
for(i=log;i>=0;i--)
if(p[x][i]!=-1&&p[x][i]!=p[y][i]&&p[y][i]!=-1)
{x=p[x][i];
y=p[y][i];}
return a[x];}
int main()
{ifstream f1("lca.in");
freopen("lca.out","w",stdout);
f1>>n>>m;
l[1]=1;
for(i=2;i<=n;i++)
{f1>>a[i];
l[i]=l[a[i]]+1;}
init(n,a,p);
for(j=1;j<=m;j++)
{f1>>x>>y;
printf("%ld\n",lca(n,p,a,l,x,y));}
f1.close();
fclose(stdout);
return 0;}