Apple Catching(DP)
来源:互联网 发布:淘宝集运澳洲怎么收费 编辑:程序博客网 时间:2024/05/22 02:22
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.
有两棵苹果树,掉下n个苹果,每个苹果依次从第1或2棵树上掉下,牛最多移动w次,问最多拿到多少苹果。
dp[i][j][2]表示i个苹果掉落,j次转移,在哪个苹果树下。
然后根据这个xjb转移就行了。
#include<cstdio>#include<cstring>#include<iostream>#include<queue>#include<vector>#include<algorithm>#include<string>#include<cmath>#include<set>#include<map>#include<vector>#include<stack>#include<utility>#include<sstream>using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;const int maxn = 1005;int dp[1005][40][2];int main(){ #ifdef LOCAL freopen("C:\\Users\\ΡΡ\\Desktop\\in.txt","r",stdin); //freopen("C:\\Users\\ΡΡ\\Desktop\\out.txt","w",stdout); #endif // LOCAL memset(dp,0,sizeof(dp)); int t,w,x; scanf("%d%d",&t,&w); scanf("%d",&x); if(x == 1) { dp[1][0][0] = 1; } else { dp[1][0][0] = 0; dp[1][1][1] = 1; } for(int i = 2;i <= t;i++) { scanf("%d",&x); if(x == 1) { dp[i][0][0] = dp[i - 1][0][0] + 1; for(int j = 1;j <= min(i,w);j++) { dp[i][j][0] = max(dp[i - 1][j][0],dp[i - 1][j - 1][1]) + 1; dp[i][j][1] = max(dp[i - 1][j][1],dp[i - 1][j - 1][0]); } } else { for(int j = 1;j <= min(i,w);j++) { dp[i][j][0] = max(dp[i - 1][j][0],dp[i - 1][j - 1][1]); dp[i][j][1] = max(dp[i - 1][j][1],dp[i - 1][j - 1][0]) + 1; } } } int ans = max(dp[t][min(t,w)][0],dp[t][min(t,w)][1]); printf("%d\n",ans); return 0;}
- Apple Catching 简单DP
- (基础dp).Apple Catching
- POJ2385 Apple Catching 【DP】
- POJ_2385 Apple Catching(DP)
- 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
- 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
- Android mk文件详解
- HDU 1720 A+B Coming【水】
- STL_算法_区间的比较(equal、mismatch、 lexicographical_compare)
- RGB颜色转灰度的算法公式
- 2016.1.14 清空当前的git仓库
- Apple Catching(DP)
- HDU 2018 复习时间
- 浅谈PHP数据结构之单链表
- 蓝桥杯( JAVA )——入门训练1-4
- tcp socket demo编程
- 【未解决】FileOpenPicker与FileStream共用的坑
- java中Server端和Client端常见的通信方式总结
- 2015年个人总结
- POJ 1696 Space Ant (卷包裹法求变形凸包)