水题,数字三角形,最近dp做的真不怎么样,找点信心
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;int main()
{int a[150][150], dp[150][150];int n;while (scanf("%d", &n) != EOF){int i, j;for (i = 1; i <= n; i++)for (j = 1; j <= i; j++)scanf("%d", &a[i][j]);memset(dp, 0, sizeof(dp));for (i = 1; i <= n; i++)dp[n][i] = a[n][i];for (i = n - 1; i >= 1; i--)for (j = 1; j <= i; j++){dp[i][j] =a[i][j]+ max(dp[i + 1][j], dp[i + 1][j + 1]);}printf("%d\n", dp[1][1]);}return 0;
}