DP a. 分治（重复子问题）：pb(m,n)=min(sub(m,n+1),sub(m+1,n))+grid(m,n) b. 定义状态空间: grid[m][n]: 左上角到m行n 列中数字和 c. DP 方程 f[m][n]=min
(grid [][]int)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected