hihoCoder#1037 数字三角形

原题地址

基本动归，题目中给的提示很有意思

代码：

#include <iostream>

using namespace std;

#define SIZE 128

int main() {
    int n;
    int puzzle[SIZE][SIZE];
    
    cin >> n;
    for (int i = 0; i < n; i++)
        for (int j = 0; j <= i; j++)
            cin >> puzzle[i][j];
    
    for (int i = n - 2; i >= 0; i--)
        for (int j = 0; j <= i; j++)
            puzzle[i][j] += max(puzzle[i + 1][j], puzzle[i + 1][j + 1]);
 
 
    cout << puzzle[0][0] << endl;
    return 0;
}