Pagini recente » Cod sursa (job #1355631) | Cod sursa (job #510486) | Cod sursa (job #304594) | Cod sursa (job #2405881) | Cod sursa (job #3207219)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");
vector <int> l[100001];
void form(int father, int node){
for(int i:l[father]){
l[node].push_back(i);
}
}
void rezolv(int a,int b){
for(int i:l[a]){
for(int j:l[b]){
if(i<j)
break;
if(i==j){
fout<<i<<endl;
return;
}
}
}
}
int main() {
int n,m,a,x,y;
fin>>n>>m;
l[1].push_back(1);
for(int i=2;i<=n;i++){
fin>>a;
l[i].push_back(i);
form(a,i);
}
for(int i=1;i<=m;i++){
fin>>x>>y;
rezolv(x,y);
}
return 0;
}