Apple Catching
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6145 | Accepted: 2960 |
Description
It is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) 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 (1 <= T <= 1,000) minutes. Bessie is willing to walk back and forth at most W (1 <= W <= 30) times. Given which tree will drop an apple each minute, determine the maximum number of apples which Bessie can catch. Bessie starts at tree 1.
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 (1 <= T <= 1,000) minutes. Bessie is willing to walk back and forth at most W (1 <= W <= 30) times. Given which tree will drop an apple each minute, determine the maximum number of apples which Bessie can catch. Bessie starts at tree 1.
Input
* Line 1: Two space separated integers: T and W
* Lines 2..T+1: 1 or 2: the tree that will drop an apple each minute.
* Lines 2..T+1: 1 or 2: the tree that will drop an apple each minute.
Output
* Line 1: The maximum number of apples Bessie can catch without walking more than W times.
Sample Input
7 2 2 1 1 2 2 1 1
Sample Output
6
题目大意就是一头牛在两棵树下狂奔吃苹果,求吃的最多的苹果...
dp可以解决 state[i][j] = max(state[i-1][j]+apple ,state[i-1][j-1]+apple); 这就是状态方程 i表示落了几次苹果 j表示狂奔了几次..
#include <iostream>
#include <cstdio>#include <cstring>
#define appleFall 1001
#define maxTimes 31
using namespace std;
int main()
{
int state[appleFall][maxTimes];
int myApple[appleFall];
int Times,appleNum;
scanf("%d %d",&appleNum,&Times);
for(int i=1;i<=appleNum;i++)
{
scanf("%d",&myApple[i]);
}
int eat = -1;
memset(state,0,sizeof(state));
for(int i=1;i<=appleNum;i++)
for(int j=0;j<=Times;j++)
{
int apple = (myApple[i]+j)%2;
if(0==j)
state[i][j] = state[i-1][j]+apple;
else
state[i][j] = max(state[i-1][j]+apple ,state[i-1][j-1]+apple);
if(state[i][j]>eat)
eat = state[i][j];
}
printf("%d\n",eat);
return 0;
}