Submission #1074396

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-9;
const int inf=1e8;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int n;
vvi G;
pii dfs(int a){
	if(G[a].size()==0)return pii(0,0);
	int out=0;
	int de=0;
	vi tmp;
	rep(i,G[a].size()){
		pii b=dfs(G[a][i]);
		de=max(de,b.second+1);
//		out=max(out,b.first);
		tmp.pb(-b.first);
	}
	sort(all(tmp));
	out=-tmp[0]+1;
	rep(i,tmp.size()-1)if(tmp[i]==tmp[i+1])out++;
	else break;
//	cout<<a<<" "<<out<<" "<<de<<endl;
	return pii(out,de);
}
int main(){
	cin>>n;
	G=vvi(n);
	rep(i,n-1){
		int a;
		cin>>a;
		G[a-1].pb(i+1);
	}
	cout<<dfs(0).first<<endl;
}

Submission Info

Judge Result