Submission #1176605

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
 
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
 
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
 
 
def main():
    n = II()
    a = [0] + [II() for _ in range(n-1)]
    d = {}
    for i in range(1,n):
        if a[i] not in d:
            d[a[i]] = []
        d[a[i]].append(i+1)
    m = {}
    def f(i):
        if i not in d:
            return 0
        t = [f(c) for c in d[i]]
        t.sort()
        r = 0
        for c in t:
            if r < c:
                r = c
            r += 1
        return r
    return f(1)
 
 
print(main())

Submission Info

Judge Result