Submission #1073874

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back

#define N 100010
int n, f[N];
vector<int> A[N];

void ff(int x) {
	vector<int> B;
	for (vector<int>::iterator i = A[x].begin(); i != A[x].end(); i ++) {
		ff(*i);
		B.pb(f[*i]);
	}
	sort(B.begin(), B.end());
	reverse(B.begin(), B.end());
	int l = (int) B.size();
	f[x] = l;
	for (int i = 0; i < l; i ++)
		f[x] = max(f[x], B[i]+i+1);
}

int main() {
	cin >> n;
	for (int i = 1; i < n; i ++) {
		int x;
		cin >> x;
		x --;
		A[x].pb(i);
	}
	ff(0);
	printf ("%d\n", f[0]);
	return 0;
}

Submission Info

Judge Result