2021.8.11.6 数字三角形

数字三角形

n = int(input())
m = []
for i in range(n):
    m.append(list(input().split()))
ans = [[0 for i in range(n)] for j in range(n)]
test = [[0 for i in range(n)] for j in range(n)]
ans[0][0] = int(m[0][0])
for i in range(1, n):
    for j in range(i + 1):
        ans[i][j] = int(m[i][j])
        if j == 0 and test[i - 1][j - 1] > -1:
            ans[i][j] += int(ans[i - 1][j])
            test[i][j] = test[i - 1][j] - 1
        elif i == j and test[i - 1][j - 1] < 1:
            ans[i][j] += int(ans[i - 1][j - 1])
            test[i][j] = test[i - 1][j - 1] + 1
        else:
            if int(ans[i - 1][j]) > int(ans[i - 1][j - 1]):
                ans[i][j] += int(ans[i - 1][j])
                test[i][j] = test[i - 1][j] - 1
            else:
                ans[i][j] += int(ans[i - 1][j - 1])
                test[i][j] = test[i - 1][j - 1] + 1
M = 0
for i in range(n):
    if abs(test[n - 1][i]) <= 1:
        M = max(M, ans[n - 1][i])
print(M)