Cod sursa(job #3220649)
Utilizator | Data | 4 aprilie 2024 15:48:21 | |
---|---|---|---|
Problema | Lowest Common Ancestor | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("lca.in");
ofstream cout("lca.out");
int n, m, x, y;
int nivel[100001];
int v[100001];
int lca(int x,int y){
while(x!=y){
if(nivel[x]>nivel[y]){
x=v[x];
}else{
y=v[y];
}
}
return x;
}
int main()
{
cin>>n>>m;
for(int i=2;i<=n;i++){
cin >> v[i];
nivel[i]=nivel[v[i]]+1;
}
for(int i=0;i<m;i++){
cin>>x>>y;
cout<<lca(x,y)<<"\n";
}
}