python
N = int(input()) data = [list(map(int, input().split())) for _ in range(N)] dist = data[-1] for i in range(N-2, -1, -1): curr_dist = [] for j, value in enumerate(data[i]): curr_dist.append(max(value+dist[j], value+dist[j+1])) dist = curr_dist print(str(dist[0]))从最后一层开始看 取左右落点的最大值