HDU : 2391 (Filthy Rich)



// http://acm.hdu.edu.cn/showproblem.php?pid=2391
// Runtime: 1140ms
// Tag: dp

/* 
 * File:   main.cpp
 * Author: shahab
 * Created on March 18, 2011, 12:02 PM
 */

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for ( int i = (a); i < (b); i++ )
#define Fors(i, sz) for ( size_t i = 0; i < sz.size (); i++ )
#define Set(a, s) memset (a, s, sizeof (a))

using namespace std;

int matrix [1000 + 5] [1000 + 5];

int main(int argc, char** argv) {
    int testCase;
    scanf ("%d", &testCase);
    int cases = 0;

    while ( testCase-- ) {
        int r, c;
        scanf ("%d %d", &r, &c);
        
        for (int i = 0; i < 1005; i++ ) matrix [0] [i] = matrix [i] [0] = 0;

        For (i, 1, r + 1) {
            For (j, 1, c + 1) {
                scanf ("%d", &matrix [i] [j]);
                matrix [i] [j] += max (matrix [i - 1] [j], matrix [i] [j - 1]);
            }
        }

        printf ("Scenario #%d:\n", ++cases);
        printf ("%d\n\n", matrix [r] [c]);
    }
    return 0;
}

// @END_OF_SOURCE_CODE
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s