김기헌

#include<vector> #include<algorithm> using namespace std; int solution(vector<vector<int>> triangle) { int answer = 0; int s = triangle.size(); triangle[0].push_back(triangle[0][0]); for (int i = 1; i < s; i++) { triangle[i][0] = triangle[i][0] + triangle[i - 1][0]; triangle[i][i] = triangle[i][i] + triangle[i - 1][i - 1]; for (int j = 1; j < i; j++) { triangle[i][j] = triangle[i][j] + max(triangle[i - 1][j], triangle[i - 1][j - 1]); } } for (int i = 0; i < s; i++) answer = max(answer, triangle[s - 1][i]); return answer; }