POJ - 2385 Apple Catching (DP)
2016-10-25 19:43
477 查看
Apple Catching
Submit Status
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.
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.
Output
* Line 1: 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 2, then two in a row from tree 1, then two in a row from tree 2, then two in a row from tree 1. Bessie is willing to walk from one tree to the other twice.
OUTPUT DETAILS:
Bessie can catch six apples by staying under tree 1 until the first two have dropped, then moving to tree 2 for the next two, then returning back to tree 1 for the final two.
这题因为情况比较简单就两颗树,通过移动的次数就可以推出在那一棵树的位置,只要发现这个技巧点 应该就可以推出状态转移方程了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1010;
int a
, dp
[50];
int main()
{
int n, w;
while(scanf("%d %d", &n, &w)!=EOF)
{
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
scanf("%d", &a[i]);
}
if(a[1]==1)
{
dp[1][1]=0;
dp[1][0]=1;
}
else
{
dp[1][1]=1;
dp[1][0]=0;
}
for(int i=2;i<=n;i++)
{
for(int j=0;j<=w;j++)
{
if(j==0)
{
dp[i][j]=dp[i-1][j];
}
else
{
dp[i][j]=max(dp[i-1][j],dp[i-1][j-1]);
}
if(j%2+1==a[i])
{
dp[i][j]++;
}
}
}
int ans=0;
for(int i=0;i<=w;i++)
{
ans=max(ans,dp
[i]);
}
printf("%d\n",ans);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 65536KB | 64bit IO Format: %lld & %llu |
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.
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.
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
Hint
INPUT DETAILS:
Seven apples fall - one from tree 2, then two in a row from tree 1, then two in a row from tree 2, then two in a row from tree 1. Bessie is willing to walk from one tree to the other twice.
OUTPUT DETAILS:
Bessie can catch six apples by staying under tree 1 until the first two have dropped, then moving to tree 2 for the next two, then returning back to tree 1 for the final two.
这题因为情况比较简单就两颗树,通过移动的次数就可以推出在那一棵树的位置,只要发现这个技巧点 应该就可以推出状态转移方程了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int N = 1010;
int a
, dp
[50];
int main()
{
int n, w;
while(scanf("%d %d", &n, &w)!=EOF)
{
memset(a,0,sizeof(a));
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
{
scanf("%d", &a[i]);
}
if(a[1]==1)
{
dp[1][1]=0;
dp[1][0]=1;
}
else
{
dp[1][1]=1;
dp[1][0]=0;
}
for(int i=2;i<=n;i++)
{
for(int j=0;j<=w;j++)
{
if(j==0)
{
dp[i][j]=dp[i-1][j];
}
else
{
dp[i][j]=max(dp[i-1][j],dp[i-1][j-1]);
}
if(j%2+1==a[i])
{
dp[i][j]++;
}
}
}
int ans=0;
for(int i=0;i<=w;i++)
{
ans=max(ans,dp
[i]);
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- poj 2385 Apple Catching 简单DP
- POJ 2385 Apple Catching (DP)
- POJ 2385 Apple Catching(基础DP)
- poj 2385Apple Catching(简单dp)
- POJ 2385 Apple Catching (dp)
- POJ2385 Apple Catching(DP/递推)
- POJ_2385 Apple Catching(DP)
- POJ 2385 Apple Catching(DP)
- POJ 2385 Apple Catching (DP)
- Apple Catching (poj 2385 简单dp)
- POJ 2385 Apple Catching(线性DP)
- [POJ 2385]Apple Catching[DP]
- POJ 2385 Apple Catching 接苹果 DP
- POJ2385 Apple Catching (dp)
- poj 2385 Apple Catching(dp)
- POJ_2385_Apple Catching_简单DP
- POJ 2385-Apple Catching (基础DP)
- poj 2385 Apple Catching 基础dp
- POJ 2385 Apple Catching(DP)
- poj 2385 Apple Catching (DP)