[BAEKJOON] 1932 숫자 삼각형

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n; vector<vector<int>> map(501, vector<int>(501)); scanf("%d", &n); for (int y = 0; y < n; y++) for (int x = 0; x <= y; x++) scanf("%d", &map[x][y]); for (int y = n-1; y > 0; y--) for (int x = 0; x < y; x++) map[x][y - 1] += max(map[x][y], map[x + 1][y]); printf("%d", map[0][0]); return 0; }