Pagini recente » Cod sursa (job #3357729) | Monitorul de evaluare | Profil Black_Elf | Monitorul de evaluare | Cod sursa (job #3357728)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("lca.in");
ofstream cout ("lca.out");
vector < vector < int > > gr(100100);
vector < int > dad (100100);
vector < int > lv (100100);
void dfs (int root){
for (auto &x : gr[root]){
dad[x] = root;
lv[x] = lv[root] + 1;
dfs(x);
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n , m;
cin>>n>>m;
for (int i=2; i<=n; i++){
int x;
cin>>x;
gr[x].push_back(i);
}
lv[1] = 1;
dfs(1);
for (int i=1; i<=m; i++){
int x , y;
cin>>x>>y;
while (x != y){
if (lv[x] > lv[y]){
x = dad[x];
}
else{
y = dad[y];
}
}
cout<<x<<'\n';
}
return 0;
}