Apple Catching POJ 2385
来源:互联网 发布:sparklehorse知乎 编辑:程序博客网 时间:2024/05/24 04:05
Apple Catching
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 11481 Accepted: 5537
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.
Source
USACO 2004 November
原题:点击打开链接
#include <iostream>#include <stdio.h>#include <algorithm>#include <string.h>using namespace std;int dp[1005][35][3],data[1005];int main(){ int n,m; memset(dp,0,sizeof(dp)); memset(data,0,sizeof(data)); cin>>n>>m; for(int i=1;i<=n;i++) { scanf("%d",&data[i]); } if(data[1]==1) { dp[1][0][1]=1; dp[1][1][1]=1; } else { dp[1][0][2]=1; dp[1][1][2]=1; } for(int i=2;i<=n;i++) { for(int j=0;j<=m;j++) { if(data[i]!=data[i-1]&&j>=1) { if(data[i]==1) { dp[i][j][1]=max(dp[i-1][j][1],dp[i-1][j-1][2])+1; dp[i][j][2]=max(dp[i-1][j][2],dp[i-1][j-1][1]); } else { dp[i][j][2]=max(dp[i-1][j][2],dp[i-1][j-1][1])+1; dp[i][j][1]=max(dp[i-1][j][1],dp[i-1][j-1][2]); } } else { if(data[i]==1) { dp[i][j][1]=dp[i-1][j][1]+1; dp[i][j][2]=dp[i-1][j][2]; } else { dp[i][j][1]=dp[i-1][j][1]; dp[i][j][2]=dp[i-1][j][2]+1; } } } } int Max=0; for(int i=0;i<=m;i++) Max=max(Max,max(dp[n][i][1],dp[n][i][2])); printf("%d\n",Max); return 0;}
- POJ 2385 Apple Catching
- POJ-2385-Apple Catching
- poj 2385 Apple Catching
- POJ 2385 Apple Catching
- poj 2385 Apple Catching
- POJ 2385 Apple Catching
- Apple Catching.(POJ-2385)
- poj 2385 Apple Catching
- poj 2385 Apple Catching
- POJ 2385Apple Catching
- poj 2385 Apple Catching
- POJ 2385 Apple Catching
- POJ 2385 Apple Catching
- POJ 2385 Apple Catching
- POJ 2385 Apple Catching
- POJ 2385 Apple Catching
- poj-2385-Apple Catching
- Apple Catching POJ 2385
- 2016年规划
- git push 代码报错——(change 24610 closed)
- 华为交换机支持Vlanif数
- C++里面表达(a/b)的写法
- strongswan_freeradius_openldap
- Apple Catching POJ 2385
- 求解偏微分方程开源有限元软件deal.II学习--Step 13
- php JQuery中的AJax提交过来的是乱码 不同浏览器下
- linux通配符
- centos7 网速很慢解决办法----关闭ipv6
- debug的调试方法
- Centos能上内网不能上外网,问题解决!
- 静态化
- scrapy学习笔记