문제 : https://www.acmicpc.net/problem/2096 첫번째 제출 코드 (메모리 초과) import sys def solve(): MAX = 0 MIN = 0 for i in range(1, N): for j in range(3): if j == 0: dp[i][0] = arr[i][0] + max(dp[i-1][j], dp[i-1][j+1]) elif j == 1: dp[i][1] = arr[i][1] + max(dp[i-1][j-1], dp[i-1][j], dp[i-1][j+1]) else: dp[i][2] = arr[i][2] + max(dp[i - 1][j], dp[i - 1][j - 1]) MAX = max(dp[-1]) for i in range(1, N): for j i..
