HDOJ 2391
来源:互联网 发布:淘宝网隐形降权 编辑:程序博客网 时间:2024/06/10 18:38
Filthy Rich
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1367 Accepted Submission(s): 669
Problem Description
They say that in Phrygia, the streets are paved with gold. You’re currently on vacation in Phrygia, and to your astonishment you discover that this is to be taken literally: small heaps of gold are distributed throughout the city. On a certain day, the Phrygians even allow all the tourists to collect as much gold as they can in a limited rectangular area. As it happens, this day is tomorrow, and you decide to become filthy rich on this day. All the other tourists decided the same however, so it’s going to get crowded. Thus, you only have one chance to cross the field. What is the best way to do so?
Given a rectangular map and amounts of gold on every field, determine the maximum amount of gold you can collect when starting in the upper left corner of the map and moving to the adjacent field in the east, south, or south-east in each step, until you end up in the lower right corner.
Given a rectangular map and amounts of gold on every field, determine the maximum amount of gold you can collect when starting in the upper left corner of the map and moving to the adjacent field in the east, south, or south-east in each step, until you end up in the lower right corner.
Input
The input starts with a line containing a single integer, the number of test cases.
Each test case starts with a line, containing the two integers r and c, separated by a space (1 <= r, c <= 1000). This line is followed by r rows, each containing c many integers, separated by a space. These integers tell you how much gold is on each field. The amount of gold never negative.
The maximum amount of gold will always fit in an int.
Each test case starts with a line, containing the two integers r and c, separated by a space (1 <= r, c <= 1000). This line is followed by r rows, each containing c many integers, separated by a space. These integers tell you how much gold is on each field. The amount of gold never negative.
The maximum amount of gold will always fit in an int.
Output
For each test case, write a line containing “Scenario #i:”, where i is the number of the test case, followed by a line containing the maximum amount of gold you can collect in this test case. Finish each test case with an empty line.
Sample Input
13 41 10 8 80 0 1 80 27 0 4
Sample Output
Scenario #1:42
超简单的DP
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;int m[1005][1005];int a[1005][1005];int n;int main(){ //freopen("in.txt" , "r" , stdin); int T , row , col ; scanf("%d",&T); for(int Case = 1 ; Case <= T ; Case ++) { memset(m , 0 , sizeof(m)); scanf("%d%d",&row , &col); for(int i = 1 ; i <= row ; i++) { for(int j = 1 ; j <= col ; j++) { scanf("%d",&a[i][j]); } } for(int i = 1 ; i <= row ; i++) { for(int j = 1 ; j <= col ; j++) { m[i][j] = max(m[i - 1][j] , max(m[i - 1][j - 1] , m[i][j - 1])) + a[i][j]; } } printf("Scenario #%d:\n%d\n\n" , Case, m[row][col]); } return 0;}/*Scenario #1:42*/
- HDOJ 2391
- HDOJ 2391 Filthy Rich
- HDOJ 2391 Filthy Rich
- hdoj 2391 Filthy Rich
- hdoj-2391Filthy Rich
- HDOJ
- hdoj
- hdoj
- HDOJ
- hdoj 2391 Filthy Rich 【DP】
- hdoj 2391 Filthy Rich 【DP】
- (精)hdoj 2391(动态规划)
- hdoj 2391 Filthy Rich (动态规划)
- HDOJ 2391 Filthy Rich (简单DP)
- hdoj 1568 && hdoj 5344 && hdoj 5444
- HDOJ 2391 Filthy Rich dp动态规划.....so easy......
- HDOJ 题目2391Filthy Rich(水dp)
- hdoj 2391 Filthy Rich(dp)不是搜素
- 网站http服务器内部500错误的解决方法 [图文]
- 软件设计模型
- listView下拉刷新(仿sina微博Android客户端效果)
- Android-Looper类介绍
- spring MVC 注解详解以及说明
- HDOJ 2391
- IOC三种注入方法解释
- sql With 递归
- linux系统查看系统性能命令详解
- Spring中bean的作用范围:Scope属性的值
- 3DV HTM(1)
- 远程桌面连接
- Hessian, 短小精悍的webService 解决方案
- spring IOC原理