[BAEKJOON] 2096 내려가기

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <stdio.h> #define max(a,b) ((a) > (b) ? (a) : (b)) #define min(a,b) ((a) < (b) ? (a) : (b)) using namespace std; //전역변수가 메모리 범위가 더 큼 int Maxcache[100001][3], Mincache[100001][3],tower[3]; int main() { int arr_count; scanf("%d", &arr_count); int Max = 0,Min=0; for (int j = 1; j <= arr_count; j++) { scanf("%d %d %d", &tower[0], &tower[1], &tower[2]); Maxcache[j][0] = max(Maxcache[j-1][0], Maxcache[j-1][1]) + tower[0]; Maxcache[j][1] = max(Maxcache[j-1][0], max(Maxcache[j-1][1], Maxcache[j-1][2])) + tower[1]; Maxcache[j][2] = max(Maxcache[j-1][1], Maxcache[j-1][2]) + tower[2]; Mincache[j][0] = min(Mincache[j-1][0], Mincache[j-1][1]) + tower[0]; Mincache[j][1] = min(Mincache[j-1][0], min(Mincache[j-1][1], Mincache[j-1][2])) + tower[1]; Mincache[j][2] = min(Mincache[j-1][1], Mincache[j-1][2]) + tower[2]; } //Min과 Max의 메모리까지 낭비하면 안됩니다. Max = max(Maxcache[arr_count][0], max(Maxcache[arr_count][1], Maxcache[arr_count][2])); Min = min(Mincache[arr_count][0], min(Mincache[arr_count][1], Mincache[arr_count][2])); printf("%d %d", Max, Min); return 0; }