codeforces 358D D. Dima and Hares(dp)

这个题目的关键之处在于你可以发现后面的选不选会影响前面的。所以我们要想办法把这一点去掉。
dp[i][0] 表示先选 i - 1 再选 i 前 i - 1个能获得的最大价值
dp[i][1] 表示先选 i 再选 i - 1 前 i －1 个能获得的最大价值
dp[i][0] = max (dp[i - 1][0] + b[i - 1] , dp[i - 1][1] + a[i - 1]);
dp[i][1] = max (dp[i - 1][0] + c[i - 1],dp[i - 1][1] + b[i - 1]);

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;

const int maxn = 5005;
const int INF = 1e9 + 7;
int a[maxn] = {0};
int b[maxn] = {0};
int c[maxn] = {0};

int dp[maxn][2] = {0};

int main () {
    ios_base :: sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 1;i <= n; ++ i) cin >> a[i];
    for (int i = 1;i <= n; ++ i) cin >> b[i];
    for (int i = 1;i <= n; ++ i) cin >> c[i];
    for (int i = 0;i <= n; ++ i)
        dp[i][0] = dp[i][1] = -INF;
    dp[1][1] = 0;
    for (int i = 2;i <= n + 1; ++ i) {
        dp[i][0] = max (dp[i - 1][0] + b[i - 1],dp[i - 1][1] + a[i - 1]);
        dp[i][1] = max (dp[i - 1][0] + c[i - 1],dp[i - 1][1] + b[i - 1]);
    }
    cout << dp[n + 1][0] << endl;
    return 0;
}