HDU 2391 Filthy Rich（dp）

//
//  main.cpp
//  Richard
//
//  Created by 邵金杰 on 16/9/9.
//  Copyright © 2016年 邵金杰. All rights reserved.
//



#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+10;
int f[maxn][maxn],map[maxn][maxn];
int main()
{
    int t;
    int kase=0;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                scanf("%d",&map[i][j]);
                f[i][j]=map[i][j];
            }
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(i+1<=n) f[i+1][j]=max(f[i+1][j],f[i][j]+map[i+1][j]);
                if(j+1<=m) f[i][j+1]=max(f[i][j+1],f[i][j]+map[i][j+1]);
                if(i+1<=n&&j+1<=m) f[i+1][j+1]=max(f[i+1][j+1],f[i][j]+map[i+1][j+1]);
            }
        }
        cout<<"Scenario #"<<++kase<<":"<<endl;
        cout<<f[n][m]<<endl<<endl;;
    }
    return 0;
}