9465 스티커

#include <stdio.h>
#include <string.h>
#include <algorithm>
 
using namespace std;
 
int arr[3][100005] = { 0 };
int dp[3][100005] = { 0 };
 
int main() {
    int t;
    scanf("%d", &t);
 
    while (t--) {
        int n;
        scanf("%d", &n);
 
        for (int i = 1; i <= 2; i++) {
            for (int j = 1; j <= n; j++) {
                scanf("%d", &arr[i][j]);
            }
        }
 
        dp[1][1] = arr[1][1];
        dp[2][1] = arr[2][1];
        for (int i = 2 ; i <= n; i++) {
            dp[1][i] = arr[1][i] + max(dp[2][i - 1], dp[2][i - 2]);
            dp[2][i] = arr[2][i] + max(dp[1][i - 1], dp[1][i - 2]);
        }
 
        int rst = 0;
        for (int i = 1; i <= 2; i++) {
            for (int j = 1; j <= n; j++) {
                if (rst < dp[i][j])
                    rst = dp[i][j];
            }
        }
 
        printf("%d\n", rst);
 
        memset(arr[1], 0, sizeof(int) * 100004);
        memset(arr[2], 0, sizeof(int) * 100004);
        memset(dp[1], 0, sizeof(int) * 100004);
        memset(dp[2], 0, sizeof(int) * 100004);
    }
}