[BOJ] 9465. 스티커(DP)

#include <iostream>
using namespace std;
int n;
int card[2][100001];
int dp[2][100001];
int max(int x, int y) {
    return x > y ? x : y;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int test_case;
    cin >> test_case;
    for (int t = 1; t <= test_case; t++) {
        cin >> n;
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < n; j++)cin >> card[i][j];
        }
        dp[0][0] = card[0][0];
        dp[1][0] = card[1][0];
        dp[0][1] = card[0][1] + dp[1][0];
        dp[1][1] = card[1][1] + dp[0][0];
        for (int j = 2; j < n; j++) {
            for (int i = 0; i < 2; i++) {
                dp[i][j] = card[i][j] + max(dp[(i + 1) % 2][j - 1], dp[(i + 1) % 2][j - 2]);
            }
        }
        cout << max(dp[0][n-1],dp[1][n-1]) << '\n';
        for (int i = 0; i < 2; i++) {//다시 초기화
            for (int j = 0; j < n; j++) {
                dp[i][j] = 0;
                card[i][j] = 0;
            }
        }

    }
}