Submission #1586710

---

Source Code Expand

#include <iostream>

using namespace std;

int memo[100005];

int   getDepth(int *A,int i){
    if (memo[i]!=-1) return memo[i];
    if (!A[i])
        return 0;
    int temp = (1+getDepth(A,A[i]));
    memo[i] = temp;
    return temp;
}

int main()
{
    int n;
    cin >> n;
    int A[n+1];
    int temp;
    int B[100005] = {0};
    int Max=0;
    for (int i=2;i<n+1;i++){
        cin >> A[i];
        if (A[i]!=1) B[A[i]]++;
        Max = max(Max,B[A[i]]);
    }
    A[1] = 0;
    int depth = 0;
    for (int i=1;i<n+1;i++)
        memo[i]=-1;

    for (int i=1;i<n+1;i++)
        depth = max(depth,getDepth(A,i));
    if (Max)
        depth+=Max-1;
    cout << depth;
    return 0;
}

Submission Info

Judge Result