[BOJ] 9465번 스티커 (Python)
import sys
input=sys.stdin.readline
t = int(input())
for _ in range(t):
n = int(input())
dp = [list(map(int,input().split())) for _ in range(2)]
if n == 1:
print(max(dp[0][0], dp[1][0]))
else:
dp[0][1] += dp[1][0]
dp[1][1] += dp[0][0]
for j in range(2, n):
dp[0][j] += max(dp[1][j-1], dp[1][j-2])
dp[1][j] += max(dp[0][j-1], dp[0][j-2])
print(max(dp[0][n-1],dp[1][n-1]))

댓글남기기