View Code of Problem 4055

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main(void)
{
    int n;
    cin >> n;
    int arr[n][n] = {0};
    int dp[n][n] = {0};
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            cin >> arr[i][j];
            if (i == n - 1)
                dp[i][j] = arr[i][j];
        }
    }
    for (int i = n - 1; i >= 0; i--)
    {
        for (int j = 0; j <= i; j++)
        {
            dp[i - 1][j] = max(dp[i][j] + arr[i - 1][j], dp[i][j + 1] + arr[i - 1][j]);
        }
    }
    cout << dp[0][0] << endl;
}