UVALive 6510 Stickers

Stickers

Time Limit: 3000ms

Memory Limit: 131072KB

This problem will be judged on UVALive. Original ID: 6510
64-bit integer IO format: %lld      Java class name: Main

　　解题：动态规划

　

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int dp[maxn][3],a[2][maxn],n;
int main(){
    int kase;
    scanf("%d",&kase);
    while(kase--){
        scanf("%d",&n);
        for(int i = 1; i <= n; ++i)
            scanf("%d",&a[0][i]);
        for(int i = 1; i <= n; ++i)
            scanf("%d",&a[1][i]);
        memset(dp,0,sizeof dp);
        for(int i = 1; i <= n; ++i){
            dp[i][0] = max(dp[i-1][2],max(dp[i-1][0],dp[i-1][1]));
            dp[i][1] = max(dp[i-1][0],dp[i-1][2]) + a[0][i];
            dp[i][2] = max(dp[i-1][0],dp[i-1][1]) + a[1][i];
        }
        printf("%d
",max(max(dp[n][0],dp[n][1]),dp[n][2]));
    }
    return 0;
}
/*
2
5
50 10 100 20 40
30 50 70 10 60
7
10 30 10 50 100 20 40
20 40 30 50 60 20 80
*/