如果你觉得你复杂度对的话就认为去吧
代码没错
by Wildchesse @ 2023-10-12 19:04:51
猜你想搜：记忆化搜索
by YiX01 @ 2023-10-12 19:08:13
非常显然的，搜索会超时。
广搜会好一些？
by CEFqwq @ 2023-10-12 19:09:30
这是指数级的吧？
by 沉石鱼惊旋 @ 2023-10-12 19:11:31
```cpp
#include <stdio.h>
typedef long long LL;
const LL min_ll = -1e18;
int n, m; LL w[1005][1005], f[1005][1005][2];
inline LL mx(LL p, LL q, LL r) {return p > q ? (p > r ? p : r) : (q > r ? q : r);}
inline LL dfs(int x, int y, int from) {
if (x < 1 || x > n || y < 1 || y > m) return min_ll;
if (f[x][y][from] != min_ll) return f[x][y][from];
if (from == 0) f[x][y][from] = mx(dfs(x + 1, y, 0), dfs(x, y - 1, 0), dfs(x, y - 1, 1)) + w[x][y];
else f[x][y][from] = mx(dfs(x - 1, y, 1), dfs(x, y - 1, 0), dfs(x, y - 1, 1)) + w[x][y];
return f[x][y][from];
}
int main(void) {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j) {
scanf("%lld", &w[i][j]);
f[i][j][0] = f[i][j][1] = min_ll;
}
f[1][1][0] = f[1][1][1] = w[1][1];
printf("%lld\n", dfs(n, m, 1));
return 0;
}
```
by ruanweijie @ 2023-10-14 22:18:35
记忆化搜索
by ruanweijie @ 2023-10-14 22:19:19
如果深搜可以取代记搜和 DP 的话，那请问记搜和 DP 存在的意义是什么呢
by WYZ20030051 @ 2023-10-16 17:12:40