POJ 2385 - Apple Catching [DP]

dp[i][j]表示在i时刻使用j次转移得到的最多苹果数

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

int a[1024], dp[1024][35];

int main()
{
    int n, w;
    cin >> n >> w;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
        if(a[i] == 1) dp[i][0] = dp[i-1][0] + 1;
    }
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= w; ++j)
            dp[i][j] = max(dp[i-1][j-1] + (a[i]==j%2+1), dp[i-1][j] + (a[i]==j%2+1));
    cout << dp
[w] << endl;
    return 0;
}