백준 - DP (#9465)

https://www.acmicpc.net/problem/9465

Code

T = int(input())

for i in range(T):
    n = int(input())
    row1 = list(map(int,input().split()))
    row2 = list(map(int,input().split()))
    arr = [row1, row2]
    arr_sum = [[0 for col in range(n)] for row in range(2)]
    arr_sum[0][0] = arr[0][0]
    arr_sum[1][0] = arr[1][0]

    for j in range(1,n):
        if j == 1:
            arr_sum[0][j] = arr_sum[1][j-1]+arr[0][j]
            arr_sum[1][j] = arr_sum[0][j-1]+arr[1][j] 
        else:   
            arr_sum[0][j] = max(arr_sum[1][j-1],arr_sum[1][j-2])+arr[0][j]
            arr_sum[1][j] = max(arr_sum[0][j-1],arr_sum[0][j-2])+arr[1][j]
    
    print(max(arr_sum[0][n-1],arr_sum[1][n-1]))

참고