一本通 1258：【例9.2】数字金字塔

数字金字塔

万年dp入门题

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
//Mystery_Sky
//
#define M 1010
int f[M][M], a[M][M];
int n, ans;
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= i; j++) scanf("%d", &a[i][j]);
    f[1][1] = a[1][1];
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= i; j++) f[i][j] = max(f[i-1][j], f[i-1][j-1]) + a[i][j];
    for(int i = 1; i <= n; i++) ans = max(ans, f[n][i]);
    printf("%d\n", ans);
    return 0;
}

转载于:https://www.cnblogs.com/Benjamin-cpp/p/10786113.html