Submission #1074391

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <set>
using namespace std;

typedef pair<int,int> Pii;
vector<vector<int> > G;
vector<int> mem;

int solve(int i){
  if(mem[i]>-1)return mem[i];
  if(G[i].size()==0)return 0;
  int res=0;
  int k=G[i].size();
  vector<int> tmp(k);
  for(int j=0;j<k;++j)tmp[j]=solve(G[i][j]);
  sort(tmp.begin(),tmp.end());
  for(int j=0;j<k;++j)res=max(res,k-j+tmp[j]);
  mem[i]=res;
  return res;
}

int main(int argc, char const *argv[]) {
  long long n;cin>>n;
  G = vector<vector<int>>(n);
  vector<int> a(n);
  a[0] = -1;
  for(int i=1;i<n;++i){
    cin>>a[i];
    a[i]--;
    G[a[i]].push_back(i);
  }
  mem=vector<int>(n,-1);
  cout<<solve(0)<<endl;
  return 0;
}

Submission Info

Judge Result