Submission #1692254

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int n;
vector<vi> g(25);

int dfs(int now){
  int i;
  if(g[now].size()==0)return 1;
  int tmin=INF,tmax=0;
  rep(i,g[now].size()){
    int tmp=dfs(g[now][i]);
    tmin=min(tmin,tmp);
    tmax=max(tmax,tmp);
  }
  return tmin+tmax+1;
}


int main(void) {
  int i,j;
  cin>>n;
  rep(i,n-1){
    int a;
    cin>>a;
    g[a-1].push_back(i+1);
  }
  cout<<dfs(0)<<endl;
}

Submission Info

Judge Result