AcWing 898. 数字三角形
题目链接https://www.acwing.com/problem/content/900/
#include<iostream>
#include<algorithm>
using namespace std;
int a[550][550];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
cin >> a[i][j];
}
}
for (int i = n-1; i >=1; i--) {
for (int j = 1; j <= i; j++) {
a[n][j] = max(a[n][j], a[n][j + 1]) + a[i][j];
}
}
cout << a[n][1];
return 0;
}