Submission #1755460

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
vector<int> v[100001];

int dfs(int p){
  int res=1e9,a=0;
  for(int i=0;i<(int)v[p].size();i++){
    int b=dfs(v[p][i]);
    res=min(res,b),a=max(a,b);
  }
  
  if(res==1e9)return 0;
  return max(res+(int)v[p].size(),a+1);
}

int main(){
  int n,a[100001];
  cin>>n;
  for(int i=1;i<n;i++)cin>>a[i],v[a[i]-1].push_back(i);
  cout<<dfs(0)<<endl;   
  return 0;
}

Submission Info

Judge Result