这道题有搜索的方法可以过，不需要dp，我前几天用搜索过了。
by 0htoAi @ 2021-08-16 18:14:04
不是一般的搜索哈。
by 0htoAi @ 2021-08-16 18:14:19
```cpp
f[i][j][k][l] = aa(f[i - 1][j][k - 1][l], f[i - 1][j][k][l - 1], f[i][j - 1][k - 1][l],f[i][j - 1][k][l - 1]);
```
改成
```cpp
f[i][j][k][l] = a[i][j]+a[k][l]+aa(f[i - 1][j][k - 1][l], f[i - 1][j][k][l - 1], f[i][j - 1][k - 1][l],f[i][j - 1][k][l - 1]);
```
by haze1231 @ 2021-08-16 18:18:27
谢谢各位大佬
by xejwsy @ 2021-08-17 17:46:02