Pagini recente » Cod sursa (job #180571) | Cod sursa (job #3321186) | Cod sursa (job #3321185) | Cod sursa (job #3321183) | Cod sursa (job #3321173)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100000;
int parent[NMAX + 5];
int level[NMAX + 5];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int N;
fin >> N;
// Citim vectorul parintilor
for (int i = 0; i < N; i++) {
fin >> parent[i];
}
// Calculam nivelurile
level[0] = 0; // radacina
for (int i = 1; i < N; i++) {
level[i] = level[parent[i]] + 1;
}
// Afisam rezultatul in fisier
for (int i = 0; i < N; i++) {
fout << level[i] << " ";
}
fout << "\n";
fin.close();
fout.close();
return 0;
}