Pagini recente » Cod sursa (job #295080) | Cod sursa (job #2738175) | Cod sursa (job #486066) | Cod sursa (job #63868) | Cod sursa (job #3205864)
#include <bits/stdc++.h>
using namespace std;
ifstream in("lca.in");
ofstream out("lca.out");
const int NMAX = 100001;
vector <int> daddy[NMAX];
void depth( int nod ){
for( int i = 0; i < daddy[nod].size(); i++ ){
depth( daddy[nod][i] );
level[nod] = level[daddy[nod][i]];
}
if( !daddy[nod].size() )
level[nod] = 1;
}
int main()
{
int n, m;
in >> n >> m;
for( int i = 2; i <= n; i++ ){
int x;
in >> x;
daddy[x].push_back(i);
}
depth(1);
for( int p2 = 0; p2 < ; p2++ ){
for( int i = 2; i <= n; i++ )
lca[p2][i] = lca[p2]
}
return 0;
}