题解 | 矩阵的最小路径和

优化后的空间复杂度

import sys
from itertools import accumulate
input=sys.stdin.readline

n,m=map(int,input().split())
ans=[*accumulate([*map(int,input().split())])]
for _ in range(n-1):
    nums=[*map(int,input().split())]
    ans[0]+=nums[0]
    for i in range(1,m):
        ans[i]=min(ans[i-1],ans[i])+nums[i]
print(ans[-1])