Beans HDU
来源:互联网 发布:视频互动软件 编辑:程序博客网 时间:2024/06/06 03:18
题目链接:点我
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 611 0 7 5 13 978 4 81 6 22 41 40 9 34 16 1011 22 0 33 39 6
Sample Output
242
题意:
一个 n * m的矩阵,矩阵的每个点有不同的值,你每次可以选取坐标为(x, y) 的矩阵但是选取了这个点后你不能选取它左右相邻的点,也不能选取上一行和下一行,问最大值是多少.
思路:
动态规划, 对于一行来说,相邻的数不可同时取,容易得到状态转移方程:
dp[i]=max(dp[i-2]+a[i],dp[i-1]); 每一行和每一列进行相同的处理.
代码:
#include<cstdio>#include<algorithm>#include<cmath>#include<iostream>using namespace std;const int maxn = 200000+10;int dpx[maxn],dpy[maxn];int main(){ int n,m; while(scanf("%d %d", &n, &m) != EOF){ for(int i = 2;i<=n+1;++i){ for(int j = 2;j<=m+1;++j){ int s; scanf("%d", &s); dpy[j]=max(dpy[j-1],dpy[j-2]+s); } dpx[i]=max(dpx[i-1],dpx[i-2]+dpy[m+1]); } printf("%d\n",dpx[n+1]); } return 0;}
阅读全文
0 0
- Beans HDU
- HDU 2845 Beans
- HDU 2845 Beans
- hdu 2845 Beans
- hdu 2845 Beans
- hdu 2845 Beans
- HDU 2845 Beans
- hdu 2845 Beans
- HDU 2845 Beans
- HDU 2845 Beans
- HDU 2845 Beans
- HDU 2845 Beans (DP)
- HDU 2845 DP Beans
- HDU 2845 Beans
- Beans-hdu-2845
- hdu 2845 Beans (DP)
- hdu 3037 Saving Beans
- HDU 2845 Beans
- 网站数据分析指标体系
- Java I-O 工作机制(一) —— Java 的 I-O 类库的基本架构
- HDU
- java-StringBuilder
- COM简介及一个小Demo
- Beans HDU
- Kanade's trio hdu 6059 字典树
- LCA (最近公共祖先问题)
- SQL:count(col)不统计col为null的行
- 多线程与多进程比较
- Linux源码—异常
- linux的查找命令
- Android SQLiteDatabase数据库, SimpleCursorAdapter, Cursor
- mac下安装php-redis扩展