问题描述
源代码
nm = list(input().split())
for i in range(len(nm)):
nm[i] = int(nm[i])
arr = []
for i in range(nm[0]):
h = list(input().split())
for i in range(len(h)):
h[i] = int(h[i])
arr.append(h)
rowA = len(arr)
columnA = len(arr[0])
changeA = [[0] * (columnA+1)]*(rowA+1)
maxA = [[0] * (columnA+1)]*(rowA+1)
for i in range(0, rowA):
for j in range(0, columnA):
changeA[i+1][j+1] = arr[i][j]
i = 0
j = 0
for i in range(1, rowA+1):
for j in range(1,columnA+1):
if maxA[i-1][j] >= maxA[i][j-1]:
maxA[i][j] = maxA[i-1][j] + changeA[i][j]
else:
maxA[i][j] = maxA[i][j-1] + changeA[i][j]
print(maxA[i][j]-1)
