解题思路:
注意事项:
参考代码:
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <functional> #include <iostream> #include <algorithm> using namespace std; const int maxn = 101; const int INF = -2100000000; int a[maxn][maxn], n, d[maxn][maxn]; int dp(int i, int j) { if(d[i][j] >= 0) { return d[i][j]; } else { return d[i][j] = a[i][j] + (i == n ? 0 : max(dp(i+1,j),dp(i+1,j+1))); } } int main() { memset(d,-1,sizeof(d)); scanf("%d", &n); for(int i = 1; i <= n; ++i) { for(int j = 1; j <= i; ++j) { scanf("%d", &a[i][j]); } } printf("%d\n", dp(1,1)); return 0; }
0.0分
2 人评分