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
1 3 4 1 10 8 8 0 0 1 8 0 27 0 4
题意是:给出一个矩阵,在矩阵的每个位子都有金子,让你从左上到右下怎样得到的金子最多,最多得多少金子
思路:这道题呢,是我在贪心专题上见的,当时就是感觉应该用搜索啊,但是好像会超时,可能用dp也能做,但我没后来看到别人的思路,我明白过来。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int map[1005][1005];
int main()
{
int i,j,t,r,c,cnt=1;
scanf("%d",&t);
while(t--)
{
memset(map,0,sizeof(map));
scanf("%d %d",&r,&c);
for(i=1;i<=r;i++)
{
for(j=1;j<=c;j++)
{
scanf("%d",&map[i][j]);
map[i][j]+=max(map[i-1][j],map[i][j-1]);
}
}
printf("Scenario #%d:\n%d\n\n",cnt++,map[r][c]);
}
return 0;
}