AcWing 898. 数字三角形
原题链接:https://www.acwing.com/problem/content/900/
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int N = 510;
int f[N][N];
int main()
{
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> f[i][j];
}
}
for (int i = n - 1; i > 0; i--) {
for (int j = 1; j <= i; j++) {
f[i][j] += max(f[i + 1][j], f[i + 1][j + 1]);
}
}
printf("%d\n", f[1][1]);
return 0;
}