poj2385 Apple Catching

思路：

简单dp。

实现：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int t,w,x[1005];
int dp[1005][2][35];
int dfs(int now,int cur,int rem)
{
    if(dp[now][cur][rem] != -1)
        return dp[now][cur][rem];
    if(now == t)
        return 0;
    int p = dfs(now + 1,cur,rem) + (cur == x[now] - 1);
    if(rem >= 1)
        p = max(p, dfs(now,1 - cur,rem - 1) + (cur == x[now] - 1));
    return dp[now][cur][rem] = p;
}
int main()
{
    memset(dp,-1,sizeof(dp));
    cin >> t >> w;
    for(int i = 0;i < t;i ++)
    {
        scanf("%d",&x[i]);
    }
    cout << dfs(0,0,w) << endl;
    return 0;
}