Filthy Rich(动态规划)

发布时间:2016-12-6 18:16:13 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"Filthy Rich(动态规划)",主要涉及到Filthy Rich(动态规划)方面的内容,对于Filthy Rich(动态规划)感兴趣的同学可以参考一下。

Filthy Rich Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 695    Accepted Submission(s): 379 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.   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   #include<stdio.h> #define N 1010 int map[N][N]; int dp[N][N]; int max(int a,int b,int c) {        return (a>b? a:b)>c? (a>b? a:b):c; } int main() {        int t,k=0,r,c;        int i,j;        scanf("%d",&t);        while(t--)        {              scanf("%d%d",&r,&c);                        for(i=1;i<=r;i++)                for(j=1;j<=c;j++) scanf("%d",&map[i][j]);             for(i=0;i<=r;i++) dp[i][0]=0;             for(i=0;i<=c;i++) dp[0][i]=0; for(i=1;i<=r;i++) for(j=1;j<=c;j++) dp[i][j]=max(dp[i][j-1],dp[i-1][j],dp[i-1][j-1])+map[i][j];//状态方程,核心                     printf("Scenario #%d:\n%d\n\n",++k,dp[r][c]);       }     return 0; }

上一篇:hdu&nbsp;2393&nbsp;Higher&nbsp;Math
下一篇:struct inode 和 struct file

相关文章

相关评论