Submission #5438793

---

Source Code Expand

import sys
sys.setrecursionlimit(500000)
N = int(input())
A = [int(input()) for i in range(N-1)]
E = [[] for _ in range(N+1)]
for i, a in enumerate(A, 2):
    E[a].append(i)
#print(E)
def solve(v):
    if len(E[v])==0:
        return 0
    depth = []
    for u in E[v]:
        depth.append(solve(u))
    depth.sort(reverse=True)
    ma = 0
    for i, dep in enumerate(depth, 1):
        ma = max(ma, dep+i)
    return ma

print(solve(1))

Submission Info

Judge Result