Pagini recente » Cod sursa (job #1806858) | Cod sursa (job #1892429) | Cod sursa (job #339778) | Cod sursa (job #2763987) | Cod sursa (job #3213884)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lca.in");
ofstream fout("lca.out");
int rmq[20][200005], E[200005];
int e[200005], niv[200005], a[100005];
vector<int> L[100005];
int n, Q, m;
void DFSE(int nr, int k)
{
e[++m] = k;
niv[m] = nr;
a[k] = m;
for(auto w : L[k])
{
DFSE(nr + 1, w);
e[++m] = k;
niv[m] = nr;
}
}
void MakeE()
{
int i;
for(i=2; i<=m; i++)
E[i] = 1 + E[i/2];
}
void RMQ()
{
int i, j, l;
for(i=1; i<=m; i++)
rmq[0][i] = i;
for(i=1; i<=E[m]; i++)
{
l = (1 << i);
for(j=1; j<=m-l+1; j++)
if(niv[rmq[i-1][j]] <= niv[rmq[i-1][j+l/2]])
rmq[i][j] = rmq[i-1][j];
else rmq[i][j] = rmq[i-1][j + l/2];
}
}
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
int i, x, y;
fin >> n >> Q;
for(i=2; i<=n; i++)
{
fin >> x;
L[x].push_back(i);
}
DFSE(1, 1);
MakeE();
RMQ();
for(i=1; i<=Q; i++)
{
fin >> x >> y;
x = a[x];
y = a[y];
if(x > y) swap(x, y);
int expo = E[y - x + 1];
int l = (1 << expo);
if(niv[rmq[expo][x]] <= niv[rmq[expo][y-l+1]])
fout << e[rmq[expo][x]] << "\n";
else fout << e[rmq[expo][y-l+1]] << "\n";
}
fin.close();
fout.close();
return 0;
}