Submission #1333072

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
int N;
int ans;
vector <int> G[100001];
int sum = 0;
int dfs(int v,int p) {

  for(int i = 0; i < G[v].size(); i++) {
    int u = G[v][i];
    if(u != p) {
      
      sum = dfs(u,v);
      //cout <<v<<"   "<< sum <<endl;
      
    }
  }
  return sum + 1;
}

  
  
int main() {

  cin >> N;

  for(int i = 1; i < N; i++) {
    int a;
    cin >> a;
    a--;
    G[i].push_back(a);
    G[a].push_back(i);
  }

  
  for(int i = 0; i < G[0].size(); i++) {
    sum = 0;
    ans = max(ans,dfs(G[0][i],0));
    //cout <<"G[0][i] = "<<dfs(G[0][i],0) <<endl;
  }

  cout << ans << endl;
}

Submission Info

Judge Result