LightOj 1071.cpp

// Problem name : 1071 - Baker Vai
// Algorithm :
// Contest/Practice :
// Source :
// Comment : Whenever you start to believe  yourself,people also start to believe in you
// Date : 02-OCT-14

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<assert.h>


#define pause system("pause")
#define FOR(s,e,inc) for(int i=s;i<=e;i+=inc)
#define mod 1000000007
#define inf 1<<30
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define F first
#define S second
#define sz(x) ((int)x.size())
#define sqr(x) ( (x)* (x) )
#define eps 1e-9
#define gcd(x,y) __gcd(x,y)
#define on(x,w)  x=x|(1<<w)
#define check(x,w) (x&(1<<w))==(1<<w)?true:false
#define all(x) (x).begin(),(x).end()
#define pf printf
#define AND &&
#define OR ||

typedef long long ll;
typedef unsigned long long ull;

using namespace std;


template<class T>
inline T mod_v(T num)
{
    if(num>=0)
        return num%mod;
    else
        return (num%mod+mod)%mod;
}

template<class T>
inline void memset1(vector<T>&v,int s,T value)
{
    for(int i=0;i<s;i++)
        v[i]=value;
}

template<class T>
inline void memset2(vector<vector<T> >&v,int s1,int s2,T value)
{
    for(int i=0;i<s1;i++)
        for(int j=0;j<s2;j++)
            v[i][j]=value;
}


template<class T>
T fast_pow(T n , T p)
{
    if(p==0) return 1;
    if(p%2)
    {
        T g=mod_v ( mod_v(n) * mod_v(fast_pow(n,p-1)) );
        return g;
    }
    else
    {
        T g=fast_pow(n,p/2);
        g=mod_v( mod_v(g) * mod_v(g) ) ;
        return g;
    }
}

template<class T>
inline T modInverse(T n)
{
    return fast_pow(n,mod-2);
}

template<class T>
inline void debug(string S1,T S2,string S3)
{
    cout<<S1<<S2<<S3;
}

#ifndef ONLINE_JUDGE
#  define p(x) cout<<x<<endl;
#else if
#  define print(x) 0;
#endif

//.......Code start from here ! .......

int dp[101][101][101][3];
int n,m;
int area[101][101];

void clr()
{
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)
            for(int k=0;k<=m;k++)
                for(int l=0;l<=2;l++)
                    dp[i][j][k][l]=-1;
}

int re(int row,int col1,int col2,int mov)
{//printf("%d %d %d %d\n",row,col1,col2,mov);pause;

    if(dp[row][col1][col2][mov]!=-1) return dp[row][col1][col2][mov];

    int r=0;

    if(mov==0)
    {
        if(col1+1<col2)
            r=area[row][col1+1]+re(row,col1+1,col2,0);
        r=max(r,re(row,col1,col2,1));
    }
    else if(mov==1)
    {
        if(col2+1<=m)
            r=area[row][col2+1]+re(row,col1,col2+1,1);
        r=max(r,re(row,col1,col2,2));
    }
    else if(mov==2)
    {
        if(row+1<=n)
            r=re(row+1,col1,col2,0)+area[row+1][col1]+area[row+1][col2];
    }

    return dp[row][col1][col2][mov]=r;
}

int main()
{
    int t,tcase=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&m);

        clr();

        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                scanf("%d",&area[i][j]);

        printf("Case %d: %u\n",tcase++,re(1,1,2,0)+area[1][1]+area[1][2])  ;
    }

    return 0;
}