poj 2385 Apple Catching(dp)

Description

It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered  and ) in his field, each full of apples. Bessie cannot reach the apples when they are on the tree, so she must wait for them to fall. However, she must catch them in the air since the apples bruise when they hit the ground (and no one wants to eat bruised apples). Bessie is a quick eater, so an apple she does catch is eaten in just a few seconds. 

Each minute, one of the two apple trees drops an apple. Bessie, having much practice, can catch an apple if she is standing under a tree from which one falls. While Bessie can walk between the two trees quickly (in much less than a minute), she can stand under only one tree at any time. Moreover, cows do not get a lot of exercise, so she is not willing to walk back and forth between the trees endlessly (and thus misses some apples). 

Apples fall (one each minute) for T ( <= T <= ,) minutes. Bessie is willing to walk back and forth at most W ( <= W <= ) times. Given which tree will drop an apple each minute, determine the maximum number of apples which Bessie can catch. Bessie starts at tree .

Input

* Line : Two space separated integers: T and W 

* Lines ..T+:  or : the tree that will drop an apple each minute.

Output

* Line : The maximum number of apples Bessie can catch without walking more than W times.

Sample Input

Sample Output

Hint

INPUT DETAILS: 

Seven apples fall - one from tree , then two in a row from tree , then two in a row from tree , then two in a row from tree . Bessie is willing to walk from one tree to the other twice. 

OUTPUT DETAILS: 

Bessie can catch six apples by staying under tree  until the first two have dropped, then moving to tree  for the next two, then returning back to tree  for the final two.

Source

USACO 2004 November

 

设dp[i][j]表示找到第i个苹果时，走了j步时 苹果的最大值。

首先要初始化，见代码

dp[i][j]=max(dp[i-1][j],dp[i-1][j-1]);表示走或不走取最大值。然后判断是否能够dp[i][j]++。最后找出最大值

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<cmath>
 using namespace std;
 #define W 36
 #define N 1006
 int dp[N][W];
 int n,w;
 int a[N];
 int main()
 {
     while(scanf("%d%d",&n,&w)==){
         //int sum=0;
         for(int i=;i<=n;i++){
             scanf("%d",&a[i]);
         }
         memset(dp,,sizeof(dp));
         if(a[]==){
             dp[][]=;
             dp[][]=;
         }
         if(a[]==){
             dp[][]=;
             dp[][]=;
         }

         for(int i=;i<=n;i++){
             for(int j=;j<=w;j++){
                 if(j==){
                     dp[i][j]=dp[i-][j]+(j%+==a[i]);
                     continue;
                 }
                 dp[i][j]=max(dp[i-][j],dp[i-][j-]);
                 if(j%+==a[i]){
                     dp[i][j]++;
                 }
             }
         }
         int ans=dp[n][];
         for(int i=;i<=w;i++){
             ans=max(ans,dp[n][i]);
         }
         printf("%d\n",ans);

     }
     return ;
 }

还有一种方法：

设dp[i][j]表示找到第i个苹果时，最多走了j步 苹果的最大值

则可以由

           前i-1分钟最多走j次

           前i-1分钟最多走j-1次

     这两个状态转移过来

注意，第二种的转移第j次可以选择走或者不走。因为是最多走j次

跟以前做过的一个树形DP神似

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<cmath>
 using namespace std;
 #define W 36
 #define N 1006
 int dp[N][W];
 int n,w;
 int a[N];
 int main()
 {
     while(scanf("%d%d",&n,&w)==){
         //int sum=0;
         for(int i=;i<=n;i++){
             scanf("%d",&a[i]);
         }
         memset(dp,,sizeof(dp));
         if(a[]==) dp[][]=;
         dp[][]=;
         for(int i=;i<=n;i++){
             for(int j=;j<=w;j++){
                 if(j==){
                     dp[i][j]=dp[i-][j]+(j%+==a[i]);
                     continue;
                 }

                 dp[i][j]=max(dp[i][j],dp[i-][j]+(j%+==a[i]));
                 dp[i][j]=max(dp[i][j],dp[i-][j-]+(j%==a[i]));
                 dp[i][j]=max(dp[i][j],dp[i-][j-]+(j%+==a[i]));
             }
         }
         printf("%d\n",dp[n][w]);
     }
     return ;
 }