[백준 1932] 정수 삼각형 (DP) (C/C++)

#include <iostream>
#include <algorithm>
using namespace std;
 
int N;
int arr[510][510];
int dp[510][510];
 
int solve(int row, int col)
{
    if(row == N)
    {
        return 0;
    }
    
    if(dp[row][col] != 0)
    {
        return dp[row][col];
    }
    
    dp[row][col] = max(solve(row+1, col) + arr[row][col], solve(row+1, col+1) + arr[row][col+1]);
    
    return dp[row][col];
}
 
int main(void)
{
//    freopen("B1932_input.txt", "r", stdin);
    
    cin >> N;
 
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j <= i; j++)
        {
            cin >> arr[i][j];
        }
    }
    
    cout << solve(0, 0);
    
    return 0;
}