정수 삼각형

programmers.co.kr/learn/courses/30/lessons/43105?language=cpp

코딩테스트 연습 - 정수 삼각형

#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int dp[500][500];

int solution(vector<vector<int>> triangle) {
    int answer = 0;
    int n = triangle.size();
    dp[0][0] = triangle[0][0];
    for (int i = 1; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            if (j == 0) dp[i][j] = dp[i - 1][0] + triangle[i][j];
            else if (j == triangle[i].size()) dp[i][j] = dp[i - 1][j - 1] + triangle[i][j];
            else dp[i][j] = max(dp[i - 1][j - 1], dp[i - 1][j]) + triangle[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        if (answer < dp[n - 1][i]) answer = dp[n - 1][i];
    }
    return answer;
}