HDU-2845-Beans(简单DP)
来源:互联网 发布:淘宝下单与发货时间 编辑:程序博客网 时间:2024/05/16 10:42
Beans
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4488 Accepted Submission(s): 2115
Problem Description
Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rules: if you eat the bean at the coordinate(x, y), you can’t eat the beans anyway at the coordinates listed (if exiting): (x, y-1), (x, y+1), and the both rows whose abscissas are x-1 and x+1.
Now, how much qualities can you eat and then get ?
Input
There are a few cases. In each case, there are two integer M (row number) and N (column number). The next M lines each contain N integers, representing the qualities of the beans. We can make sure that the quality of bean isn’t beyond 1000, and 1<=M*N<=200000.
Output
For each case, you just output the MAX qualities you can eat and then get.
Sample Input
4 6
11 0 7 5 13 9
78 4 81 6 22 4
1 40 9 34 16 10
11 22 0 33 39 6
Sample Output
242
题意:吃掉(i,j)后,他的左右两格和上下两行都不能再吃了,求获取的最大数值
坑点 1<=M*N<=200000,这个范围也是相当可以的
思路:DP_X[]取一行的最大值,DP_Y[]取每行最大值中的最大值。
状态转移方程:
DP_X[0]=DP_X[1]=DP_Y[0]=DP_Y[1]=0//注意(0,0),(1,1)都初始化为0,从(2,2)开始接收数据
DP_X[i]=max(DP_X[j-2]+num,DP_X[j-1]);
DP_Y[i]=max(DP_Y[i-2]+DP_X[M+1],DP_Y[i-1]
代码
#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#include<vector>using namespace std;//简单DPconst int maxn=200005;int DP_X[maxn];int DP_Y[maxn];int main(){ int N,M; while(~scanf("%d%d",&N,&M)) { DP_X[0]=DP_X[1]=0; DP_Y[0]=DP_Y[1]=0; for(int i=2; i<=N+1; i++) { for(int j=2; j<=M+1; j++) { int flag; scanf("%d",&flag); DP_X[j]=max(DP_X[j-2]+flag,DP_X[j-1]);//应该不用比较自身吧 } DP_Y[i]=max(DP_Y[i-2]+DP_X[M+1],DP_Y[i-1]); } printf("%d\n",DP_Y[N+1]); } return 0;}
- HDU-2845-Beans(简单DP)
- HDU-2845-Beans-简单dp
- hdu 2845 Beans(dp)
- hdu 2845 Beans(dp)
- HDU 2845 Beans (DP)
- HDU 2845 Beans(dp)
- HDU-2845 Beans(DP)
- HDU 2845 Beans(dp)
- HDU 2845 Beans (DP)
- HDU 2845 DP Beans
- hdu 2845 Beans (DP)
- HDU 2845 Beans DP
- hdu 2845 Beans dp
- HDU 2845 Beans DP -
- hdu 2845 Beans(二次DP)
- HDU-2845 Beans(两次线性dp)
- hdu 2845 Beans--二维DP
- HDU 2845 Beans 行列dp
- 一些重要网站链接
- 观察到一种光盘加密的方法
- 工作流系统之三十一 回退流的实现
- android中的通信机制总结
- Thinking in Java 里关于class的理解
- HDU-2845-Beans(简单DP)
- 工作流系统之三十二 设计模式在工作流系统开发中的运用
- 浙大数据结构基础 week3 4-2
- C语言定义数组起始地址对齐方式(IAR C99 Kinetis K66)
- Android自定义控件之CircleImageView
- 工作流系统之三十三 撤回的实现
- 上两道js面试题,关于数组字符串 之间的转化
- hash_table
- 工作流系统之三十四 集成用户系统