Apple Catching(POJ 2385)
2016-01-30 15:02
399 查看
Apple Catching
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.
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9978 | Accepted: 4839 |
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> using namespace std; int main() { int i,j,t,n,Max=0; int dp[1000+10][35]; int a[1000+10]; freopen("in.txt","r",stdin); scanf("%d%d",&t,&n); for(i=1;i<=t;i++) scanf("%d",&a[i]); for(i=1;i<=t;i++) { dp[i][0]=dp[i-1][0]+2-a[i]; //dp[i][j]={第i分钟走了j步所摘到的苹果} for(j=1;j<=n;j++) { if(j%2) //如果为奇数,说明走到了2树 dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+a[i]-1; //取前一分钟的最大值 else dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+2-a[i]; } } for(i=0;i<=n;i++) Max=max(dp[t][i],Max); printf("%d\n",Max); }
相关文章推荐
- gmapping An Incomplete Scan Matching Tutorial
- 微信 网页授权获取用户基本信息(OAuth 2.0)
- token验证失败
- iOS动画(Core Animation)
- 微信抢红包神器-安卓专享。再也不会错过红包了
- IOS图片拖拽.旋转.缩放
- Android Training 的整理和总结
- Mac下Android studio 之NDK配置教程
- Live555在Android下改造
- android学习记录2(日志、上下文、android下数据存储、xml基础)
- CSAPP Lab5--Writing a Dynamic Storage Allocator
- android之layer-list
- swift-数组array
- Android通过包名,查找包下面的指定类的类名
- WebAPP移动前端性能优化规范和设计指导
- 优化Android Studio/Gradle构建
- android studio 基础配置
- android TextView按下时改变文字颜色
- 使用quick-cocos-x接入GameCenter
- iOS优秀文章记录