문제링크 : https://school.programmers.co.kr/learn/courses/30/lessons/161988
def solution(seq):
n = len(seq)
dp = [[0] * n for _ in range(2)]
dp[0][0] = seq[0] * -1
dp[1][0] = seq[0]
for i in range(1, n):
dp[0][i] = max(-seq[i], dp[1][i-1] - seq[i])
dp[1][i] = max(seq[i], dp[0][i-1] + seq[i])
_max = 0
for i in range(2):
_max = max(max(dp[i]), _max)
return _max