노트

n = int(input()) parent = [int(input()) for _ in range(n)] high = [0 for i in range(n)] for i in range(n): if parent[i]==-1: continue high[i]=high[parent[i]-1]+1 for i in range(n): print(high[i])

n = int(input()) s = [list(map(int,input().split())) for _ in range(n)] dp = [0 for i in range(n+1)] for i in range(n): for j in range(i+s[i][0],n+1): if dp[j]