题目链接
https://www.acwing.com/problem/content/1020/
数字三角形 DP
题目思路
状态表示 : 和摘花生一样 用 f[i, j] 表示从 (1, 1) 到 (i, j) 所花费的最小值
通过代码
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int n;
int f[N][N];
int main()
{
cin >> n;
memset(f, 0x3f, sizeof f);
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= n; j ++ )
cin >> f[i][j];
f[0][1] = f[1][0] = 0;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= n; j ++ )
f[i][j] += min(f[i - 1][j], f[i][j - 1]);
cout << f[n][n] << endl;
return 0;
}