1932 정수삼각형 (숫자 삼각형 더블릿)

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int arr[510][510] = { 0 };
int dp[510][510] = { 0 };
 
int main() {
    int n;
    scanf("%d", &n);
    getchar();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            scanf("%d", &arr[i][j]);
        }
    }
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1]) + arr[i][j];
        }
    }
 
    int max = 0;
    for (int i = 1; i <= n; i++) {
        if (dp[n][i] > max)
            max = dp[n][i];
    }
 
    printf("%d", max);
}