Submission #1074504

---

Source Code Expand

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
using namespace std;
int n,val[100005],t;
vector<int> v[100005];
void dfs(int x) {
	vector<int> a;
	val[x]=0;
	if(v[x].size()==0) {
		return;
	}
	for(int i=0;i<v[x].size();++i) {
		dfs(v[x][i]);
		a.pb(val[v[x][i]]);
	}
	sort(a.begin(),a.end());
	for(int i=0;i<a.size();++i) {
		val[x]=max(val[x],a[i]);
		++val[x];
	}
}
int main(){
	cin>>n;
	for(int i=2;i<=n;++i) {
		cin>>t;
		v[t].pb(i);
	}
	dfs(1);
	cout<<val[1]<<endl;
}

Submission Info

Judge Result