light oj 1071 dp（吃金币升级版）

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#define ll long long

using namespace std;
const int N = 1e5+1000;

int dp[105*2][105][105];
int maze[105][105];


int dfs(int sum,int a,int b)
{
    if(dp[sum][a][b] != -1)
        return dp[sum][a][b];
    if(sum == 0 && a == 0 && b == 0)
        return dp[sum][a][b] = maze[0][0];
    dp[sum][a][b] = 0;
    if(a == b)
    {
        if(sum - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a,b) + maze[a][sum-a]);
        if(sum - 1 >= 0 && a - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a-1,b)+ maze[a][sum-a]);
        if(sum - 1 >= 0 && b - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a,b-1) + maze[a][sum-a]);
        if(sum - 1 >= 0 && a - 1 >= 0 && b - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a-1,b-1) + maze[a][sum-a]);
    }
    else
    {
        if(sum - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a,b) + maze[a][sum-a]+maze[b][sum-b]);
        if(sum - 1 >= 0 && a - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a-1,b)+ maze[a][sum-a]+maze[b][sum-b]);
        if(sum - 1 >= 0 && b - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a,b-1) + maze[a][sum-a]+maze[b][sum-b]);
        if(sum - 1 >= 0 && a - 1 >= 0 && b - 1 >= 0)
        dp[sum][a][b] = max(dp[sum][a][b],dfs(sum-1,a-1,b-1) + maze[a][sum-a]+maze[b][sum-b]);
    }
    return dp[sum][a][b];
}

void solve()
{
    int m,n;
    scanf("%d %d",&m,&n);
    memset(dp,-1,sizeof(dp));
    memset(maze,0,sizeof(maze));
    for(int i = 0; i < m; i++)
        for(int j = 0; j < n; j++)
        scanf("%d",&maze[i][j]);

    int ans = dfs(n+m-2,m-1,m-1);

    printf("%d
",ans);
}

int main(void)
{
    int t,cnt = 0;
    scanf("%d",&t);

    while(t--)
    {
        printf("Case %d: ",++cnt);
        solve();
    }
    return 0;
}