#include<stdio.h>
#include<iostream>
using namespace std;
int m,n,a[55][55],f[55][55][55][55];
int maxx(int a,int b){
return a>b?a:b;
}
int d(int x1,int y1,int x2,int y2){
if(f[x1][y1][x2][y2]>0)
return f[x1][y1][x2][y2];
else if(x1==m&&y1==n-1&&x2==m-1&&y2==n)
return f[x1][y1][x2][y2]=a[x1][y1]+a[x2][y2];
else{
int t1x1=x1+1,t1y1=y1 , t2x1=x1,t2y1=y1+1;//(t1x1,t1y1)表示(x1,y1)向下搜索,(t2x1,t2y1)表示(x1,y1)向右搜索
int t1x2=x2+1,t1y2=y2 , t2x2=x2,t2y2=y2+1;//(t1x2,t1y2)表示(x2,y2)向下搜索,(t2x2,t2y2)表示(x2,y2)向右搜索
int i=0,j=0,k=0,l=0,mmax=0;
if(t1x1<=m&&t1x2<=m)
i=d(t1x1,t1y1,t1x2,t1y2)+a[x1][y1]+a[x2][y2];
if(t1x1<=m&&t2y2<=n)
j=d(t1x1,t1y1,t2x2,t2y2)+a[x1][y1]+a[x2][y2];
if(t2y1<=n&&t1x2<=m&&((t1x2!=t2x1)||(t1y2!=t2y1)))//注意(x1,y1)向右,(x2,y2)向小可能重叠
k=d(t2x1,t2y1,t1x2,t1y2)+a[x1][y1]+a[x2][y2];
if(t2y1<=n&&t2y2<=n)
l=d(t2x1,t2y1,t2x2,t2y2)+a[x1][y1]+a[x2][y2];
mmax=maxx(maxx(i,j),maxx(k,l));
return f[x1][y1][x2][y2]=mmax;
}
}
int main(){
cin>>m>>n;
for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) cin>>a[i][j];
cout<<d(2,1,1,2);
return 0;
}
题解:记忆化搜索。
开始和回来必经过(1,2)和(2,1) 到达和回来必经过(m,n-1)和(m-1,n)
让(x1,y1)从(2,1)、(x2,y2)从(1,2)开始搜索
(t1x1,t1y1)表示(x1,y1)向下搜索,(t2x1,t2y1)表示(x1,y1)向右搜索,(t1x2,t1y2)表示(x2,y2)向下搜索,(t2x2,t2y2)表示(x2,y2)向右搜索。