Submission #1074509

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define repp(i, m, n) for(int i = m; i < n; i++)
#define reps(i, n) for(int i = 1; i <= n; i++)
const int    INF = 100000000;
const double EPS = 1e-10;
const int    MOD = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int, int> pai;
typedef pair<ll,ll> pal;

int fuka[100010];
int n;
int a[100010];
vector<int> child[100010];
vector<int> sagyo[100010];

void dfs(int v)
{
	rep(i, child[v].size()) dfs(child[v][i]), sagyo[v].push_back(fuka[child[v][i]]);
	fuka[v]=child[v].size();
	sort(sagyo[v].begin(), sagyo[v].end());
	rep(i, sagyo[v].size()) fuka[v]=max(fuka[v], ((int)sagyo[v].size())-i+sagyo[v][i]);
}

int main()
{
	cin >> n;
	repp(i, 2, n+1) cin >> a[i], child[a[i]].push_back(i);
	dfs(1);
	cout << fuka[1] << endl;
	return 0;
}

Submission Info

Judge Result