Pagini recente » Cod sursa (job #652583) | Cod sursa (job #1181128) | Cod sursa (job #668344) | Cod sursa (job #2180176) | Cod sursa (job #3137064)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
const int N = 1e5 + 10;
int v[N], h[N];
int solve(int a, int b){
while(h[a] > h[b]){
a = v[a];
}
while(h[b] > h[a]){
b = v[b];
}
while(v[a] != v[b]){
a = v[a];
b = v[b];
}
if(a == b)
return a;
else
return v[a];
}
int main()
{
int n, m;
f >> n >> m;
h[1] = 0;
for(int i = 2; i <= n; i++){
int x;
f >> x;
v[i] = x;
h[i] = h[x] + 1;
}
int a, b;
while(m){
f >> a >> b;
g << solve(a, b) << "\n";
m--;
}
return 0;
}