Submission #1991368

---

Source Code Expand

#include<bits/stdc++.h>

const int MX=100005;

using namespace std;
int n,f[MX],x[MX];
vector<int>G[MX];
void dfs(int k){
	int c=0;
	for(auto i:G[k])dfs(i),x[++c]=f[i];
	if(c){sort(x+1,x+c+1);for(int i=1;i<=c;i++)f[k]=max(f[k],x[c-i+1]+i);}
}
int main(){
	cin>>n;
	for(int i=2,u;i<=n;i++)cin>>u,G[u].push_back(i);
	dfs(1);
	cout<<f[1]<<endl;
	return 0;
}

Submission Info

Judge Result