Filthy Rich
来源:互联网 发布:c语言连用else if 编辑:程序博客网 时间:2024/05/21 08:35
Filthy Rich
Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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.
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.
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
Sample Output
Scenario #1:
42
思路:
这道题是求从左上角开始,只能向右或向下走时,走到右下角能获得的做大收获。 基础DP问题。
#include<algorithm>#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N = 1000 + 5;int dp[N][N];int main(){ int t, cnt = 0; scanf("%d", &t); while (t--) { cnt++; int m, n; scanf("%d %d", &m, &n); for(int i = 1; i <= m; ++i) for(int j = 1; j <= n; ++j) { int c; scanf("%d", &c); dp[i][j] = max(dp[i-1][j], dp[i][j-1]) + c; } printf("Scenario #%d:\n%d\n\n", cnt, dp[m][n]); } return 0;}
0 0
- Filthy Rich
- Filthy Rich
- hdu 2391 Filthy Rich
- hdu 2391 Filthy Rich
- Filthy Rich+DP
- hdu 2391 Filthy Rich
- hdu2391 Filthy Rich
- hdu 2391 Filthy Rich
- HDU 2391 Filthy Rich
- HDU2391 Filthy Rich 【DP】
- hdu 2391 Filthy Rich
- hdu 2391 Filthy Rich
- hdu 2391 Filthy Rich
- HDoj2391-Filthy Rich-DP
- HDOJ 2391 Filthy Rich
- HDU 2391 Filthy Rich
- HDU 2391 Filthy Rich
- HDOJ 2391 Filthy Rich
- 英语在未来考试中的地位
- As programs get larger
- The preprocessor
- B. Valera and Fruits
- ubuntu中root权限的获得及arm-linux-gcc交叉编译环境的搭建
- Filthy Rich
- F广搜
- ecshop源码分析:smarty模板类
- Java经典23种设计模式之行为型模式(二)
- JSON学习笔记
- [LeetCode] Combinations
- 验证日期是否正确
- XListView的介绍和使用
- TI C66x DSP 系统events及其应用 - 5.8(ISTP)