Submission #1692438

---

Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,x,n) for(int i=(x);i<(n);i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define ub upper_bound
#define lb lower_bound
//#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=1000000009;
vector<vector<int>> v;

int dfs(int src){
  if(v[src].size()==0)return 1;
  int MIN=INF;
  int MAX=(-1)*INF;
  rep(i,v[src].size()){
    int m=dfs(v[src][i]);
    MIN=min(MIN,m);
    MAX=max(MAX,m);
  }
  return MIN+MAX+1;
}

int main(){
  int n;
  cin>>n;
  v=vector<vector<int>> (n);

  rep(i,n-1){
    int b;
    cin>>b;
    b--;
    v[b].pb(i+1);
  }
  cout<<dfs(0)<<endl;
  return 0;
}

Submission Info

Judge Result