Submission #1357663

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

vector< vector<int> > G;
int dfs(int v){
	int size = G[v].size();
	vector<int> A;
	for(int i=0;i<size;++i){
		int to = G[v][i];
		int res = dfs(to);
		A.push_back( res );
	}
	int ret = 0;
	size = A.size();
	sort(A.begin(), A.end());
	for(int i=0;i<size;++i){
		ret = max(ret+1,A[i]+1);
	}
	return ret;
}
void solve(){
	int N;
	cin >> N;
	G = vector< vector<int> >(N);
	for(int i=1;i<N;++i){
		int a;
		cin >> a;
		--a;
		G[a].push_back( i );
	}

	int res = dfs(0);
	cout << res << endl;
}
#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result