三角形最佳路径问题

#include <iostream>
#include <cstdio>
using namespace std;
//Mystery_Sky
//还是 数字金字塔 
#define M 200
int f[M][M], a[M][M];
int ans, n;
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 = 2; 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(f[n][i], ans);
    printf("%d\n", ans);
    return 0;
} 

标签：std,int,路径,1288,最佳,三角形,include
来源： https://www.cnblogs.com/Benjamin-cpp/p/10786454.html