https://programmers.co.kr/learn/courses/30/lessons/12913
def solution(land):
dp = [[0]*4 for _ in range(len(land))]
dp[0] = land[0]
for i in range(1, len(land)): # 10만
for j in range(4): # 4
maxValue = float("-inf")
for k in range(4): # 4
if j == k:
continue
maxValue = max(maxValue, dp[i-1][k])
dp[i][j] = maxValue + land[i][j]
return max(dp[-1])