POJ 2385 Apple Catching 动态规划

#include <iostream>
using namespace std;
int num[1007], dp[37][1007], T, W;
void input()
{
    scanf("%d%d", &T, &W);
    for (int i = 1; i <= T; i++)
    {
        scanf("%d", &num[i]);
    }
}
void solve()
{
    for (int i = 1; i <= T; i++)
    {
        if (num[i] == 1)
        {
            dp[0][i] = dp[0][i - 1] + 1;
        }
        else
        {
            dp[0][i] = dp[0][i - 1];
        }
    }
    for (int i = 1; i <= W; i++)
    {
        for (int j = 1; j <= T; j++)
        {
            // 目前在1树下
            if (i % 2 == 0)
            {
                dp[i][j] = max(dp[i - 1][j - 1], dp[i][j - 1]) + (num[j] == 1 ? 1 : 0);
            }
            // 目前在2树下
            else
            {
                dp[i][j] = max(dp[i - 1][j - 1], dp[i][j - 1]) + (num[j] == 2 ? 1 : 0);
            }
        }
    }
}
int findAns()
{
    int ans = 0;
    for (int i = 0; i <= W; i++)
    {
        ans = max(ans, dp[i][T]);
    }
    return ans;
}
int main()
{
    input();
    solve();
    printf("%d\n", findAns());
    return 0;
}