吃土豆_nyoj_234(动态规划).java
来源:互联网 发布:长春软件培训 编辑:程序博客网 时间:2024/04/30 07:58
吃土豆
时间限制:1000 ms | 内存限制:65535 KB
难度:4
- 描述
- 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 ?- 输入
- 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<=500.
- 输出
- For each case, you just output the MAX qualities you can eat and then get.
- 样例输入
4 611 0 7 5 13 978 4 81 6 22 41 40 9 34 16 1011 22 0 33 39 6
- 样例输出
242
- 来源
- 2009 Multi-University Training Contest 4
import java.util.Scanner;public class Main{//动态规划public static void main(String[] args) {Scanner input=new Scanner(System.in);while(input.hasNext()){int n=input.nextInt();int m=input.nextInt();int a[][]=new int[n+3][m+3];int []b=new int[n+3];for(int i=3;i<n+3;i++){for(int j=3;j<m+3;j++){int map=input.nextInt();a[i][j]=Math.max(a[i][j-2]+map, a[i][j-1]);//找出每行最大值}b[i]=a[i][m+2];}for(int i=3;i<n+3;i++){b[i]=Math.max(b[i-2]+b[i], b[i-1]);//找出列最大值}System.out.println(b[n+2]);}}}
- 吃土豆_nyoj_234(动态规划).java
- NYOJ 吃土豆(动态规划)
- nyoj-234-吃土豆(动态规划)
- nyoj-动态规划-234-吃土豆-201308131021
- NY--234 -- 吃土豆 [二维动态规划]
- 双层动态规划_吃土豆问题
- NYOJ234吃土豆(双层动态规划)
- hdu-Beans(动态规划,nyoj-234-吃土豆)
- 【动态规划】[luoguP1508]Likecloud-吃、吃、吃
- 吃土豆
- 吃土豆
- 吃土豆
- 吃土豆
- 吃土豆
- 吃土豆
- 动态规划-吃糖果
- 动态规划:吃糖果
- 动态规划 吃糖果
- 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活{ 多重背包} (题目真长啊啊啊啊~)
- mysql数据库性能优化的关键参数及mysql服务器优化
- android之通过Button的监听器往adapter中添加数据时出错
- 动态规划
- C语言面试题大汇总之华为面试题
- 吃土豆_nyoj_234(动态规划).java
- Slackware 14 安装完全指南
- shell中几个括号的总结
- linux可执行文件的加载和运行之一
- C语言中全局变量和局部变量同名时的访问方法
- 多通道(Multichannel)单通道(singlechannel)图像概念梳理————OpenCV笔记(六)
- SOCKS5中的UDP穿透
- 使用子查询提高MySQL分页效率 limit
- 学习日记(二)Hibernate用法:针对数据库表数据的增加,查询,更新,删除