120134#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <stack>#include <cstdlib>#include <cmath>#include <set>#include <map>#include <vector>#include <cstring>#include <climits>#define INF 100000000using namespace std;int ma[50][50];int n,m;int dp[100][50][50];int fun(int a,int b,int c,int d){return max(max(a,b),max(c,d));}int main(){int t;cin >> t;while(t–){cin >> n >> m;for(int i = 0;i <= n+1;i++){for(int j = 0;j <= m+1;j++){ma[i][j] = -INT_MAX;}}for(int i = 1; i <= n;i++){for(int j = 1;j <= m;j++){scanf("%d",&ma[i][j]);}}dp[1][1][1] = ma[1][1];for(int k = 2;k <= n + m – 1;k++){//以对角线上走过的点作为状态dp[k][i][j] 的意思是走第k条对角线上的第i个和第j个点for(int i = 1;i < k ;i++){for(int j = i+1;j <= k;j++){dp[k][i][j] = ma[k-i+1][i] + ma[k-j+1][j] + fun(dp[k-1][i][j],dp[k-1][i-1][j],dp[k-1][i][j-1],dp[k-1][i-1][j-1]);}}}printf("%d\n",dp[n+m-2][m-1][m] + ma[n][m]);}return 0;}
，家!甜蜜的家!天下最美好的莫过於家
