P1006 [NOIP2008 提高组] 传纸条

https://www.luogu.com.cn/problem/P1006

这道题洛谷里的题解大都不太详细，有很多点没说出来，不过博主作为退役老人，也不太想去写博客了，这里猜想一下，我觉得这道题有$O(nm)$的做法。这里给出$O(n^2{m}^2)$的算法。

#include<bits/stdc++.h>

using namespace std;
//    clock_t start, end;
//    start = clock();
//    end = clock();
//    cout << (double) (end - start) / CLOCKS_PER_SEC << endl;
//ios::sync_with_stdio(false);
//cin.tie(nullptr);
#define  int long long
#define lowbit(x) (x&-x)
#define ispow(n) (n & (n - 1)) == 0 //O(1) 判断是否是 2^k（2的k次方）
#define rep(i, x, y) for(int i=(x);i<=(y);++i)
#define dep(i, x, y) for(int i=(x);i>=(y);--i)
#define gcd(a, b) __gcd(a,b)
const long long mod = 1e9 + 7;
const int maxn = 1e7 + 10;


int a[51][51], f[51][51][51][51];
int m, n;

int max(int i, int j, int k, int l) {
    int m = max(i, j), n = max(k, l);
    return max(m, n);
}

signed main() {
    cin >> m >> n;
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
        }
    }
    f[1][1][1][1] = 0; //garbage
    for (int i = 1; i <= m; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= m; k++) {
                for (int l = 1; l <= n; l++) {
                    if(i!=k&&j!=l)
                        f[i][j][k][l] = max(
                                f[i][j - 1][k][l - 1],
                                f[i][j - 1][k - 1][l],
                                f[i - 1][j][k - 1][l],
                                f[i - 1][j][k][l - 1]
                        ) + a[i][j] + a[k][l];
                    else
                        f[i][j][k][l] = 0;
                }
            }
        }
    }
    cout << f[m - 1][n][m][n - 1] << endl;
    return 0;
}