杭电2391
来源:互联网 发布:阿里云域名解析后 编辑:程序博客网 时间:2024/06/01 10:24
Filthy Rich
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2083 Accepted Submission(s): 934
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
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int dp[1005][1005];int m,n;int main(){int test,i,j,kase=1;scanf("%d",&test);while(test--){scanf("%d%d",&m,&n);memset(dp,0,sizeof(dp));for(i=1;i<=m;i++){for(j=1;j<=n;j++)scanf("%d",&dp[i][j]);}for(i=1;i<=m;i++){for(j=1;j<=n;j++)dp[i][j]+=max(dp[i][j-1],dp[i-1][j]);}printf("Scenario #%d:\n",kase++);printf("%d\n",dp[m][n]);printf("\n");}return 0;}
0 0
- 杭电2391
- 杭电2391 Filthy Rich
- 杭电
- 杭电
- 杭电
- 杭电2391 Filthy Rich &&杭电 2571 命运(动规)
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- 杭电ACM1225
- 杭电ACM2023
- 杭电ACM2602
- 杭电ACM2955
- linux内核源码里的链表
- Java基础第九天--正则表达式
- 【来日复制粘贴】跨sheet的数据录入
- POJ 1979-Red and Black
- 无法解析或打开软件包的列表或是状态文件 解决方案
- 杭电2391
- msg.substring()
- 【jQuery】简单的网页文本格式编辑器ckeditor
- 在C++笔试中常见的题目解析
- 基于IBM Tivoli TSM系统构建某局备份系统实施方案
- Eclipse调试多线程程序时无法到达断点
- DFS + 剪枝 —— POJ 1011
- 【三层】ADO.Net 知识小结
- ORACLE ERPR12.1(AIX6)APP-FND-01516应用产品用户名、口令或数据库无效。