传纸条（）

#include <iostream>

using namespace std;

const int N = 55;

int f[N * 2][N][N],a[N][N];
int n,m;

int main()
{
    cin >> n >> m;
    
    for (int i = 1;i <= n;i ++ )
        for (int j = 1;j <= m;j ++ )
            cin >> a[i][j];
            
    for (int k = 2;k <= n + m;k ++ )
        for (int i1 = 1;i1 <= n;i1 ++ )
            for (int i2 = 1;i2 <= n;i2 ++ )
                {
                    int j1 = k - i1,j2 = k - i2;
                    if (j1 >= 1 && j1 <= m && j2 >= 1 && j2 <= m)
                    {
                         if(i1 == i2 && k != n + m) continue;//由于每一个人不能经过2次 再次特判 
                            //只有当两个人都不走过同一个点时才有最优解
                        int cnt = a[i1][j1] + a[i2][j2];
                       
                        int &x = f[k][i1][i2];
                        x = max(x,f[k - 1][i1][i2] + cnt);
                        x = max(x,f[k - 1][i1][i2 - 1] + cnt);
                        x = max(x,f[k - 1][i1 - 1][i2] + cnt);
                        x = max(x,f[k - 1][i1 - 1][i2 - 1] + cnt);    
                    }
                }
    cout << f[n + m][n][n] << endl;//不是f[n + m][n][n] 因为代表的是i1 i2
    
    return 0;
}