HDOJ 题目2391Filthy Rich(水dp)
来源:互联网 发布:杰恩马克眼镜 知乎 编辑:程序博客网 时间:2024/05/16 04:36
Filthy Rich
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1952 Accepted Submission(s): 868
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
Source
HDU 2008-10 Public Contest
Recommend
lcy | We have carefully selected several similar problems for you: 2393 2388 2389 2386 2390
格式略坑
ac代码
#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)int dp[1010][1010];int main(){int t,c=0;scanf("%d",&t);while(t--){int n,m,i,j;scanf("%d%d",&n,&m);memset(dp,0,sizeof(dp));for(i=1;i<=n;i++){for(j=1;j<=m;j++){scanf("%d",&dp[i][j]);}}for(i=1;i<=n;i++)for(j=1;j<=m;j++){dp[i][j]+=max(dp[i-1][j-1],max(dp[i][j-1],dp[i-1][j]));}printf("Scenario #%d:\n",++c);printf("%d\n",dp[n][m]);//if(t)printf("\n");}}
0 0
- HDOJ 题目2391Filthy Rich(水dp)
- hdoj 2391 Filthy Rich 【DP】
- hdoj 2391 Filthy Rich 【DP】
- hdoj 2391 Filthy Rich(dp)不是搜素
- HDOJ 2391 Filthy Rich (简单DP)
- HDOJ 2391 Filthy Rich
- HDOJ 2391 Filthy Rich
- hdoj 2391 Filthy Rich
- hdoj-2391Filthy Rich
- HDU 2391 Filthy Rich (简单DP)
- HDU 2391 Filthy Rich(dp)
- HDU 2391 Filthy Rich(dp)
- hdu 2391 Filthy Rich(DP)
- HDOJ 2391 Filthy Rich dp动态规划.....so easy......
- hdoj 2391 Filthy Rich (动态规划)
- hdu 2391 Filthy Rich(很水的dp,记忆化搜索)
- HDU 2391 Filthy Rich (滚动dp)
- Filthy Rich+DP
- SharePoint 2013 使用 PowerShell 更新用户
- android sdcard存储方案优化(基于wrapfs文件系统):之三
- ExtJs4学习(五)最基本的Ext类
- JSTL与EL表达式(为空判断)
- 统计目录(包含子目录)下所有word文档页码数
- HDOJ 题目2391Filthy Rich(水dp)
- cuda内核(kernel)参数详解
- 如何让 cygwin 1.7.15-1 终端中显示的中文改成英文
- 第17周项目3-胖子伤不起
- Redis简介
- 干净卸载 Cloudera CDH 5 beta2(转载)
- python单下划线/双下划线使用总结
- iOS微信支付
- ORA-00119和ORA-00132解决方法