@[TechnobladePlus](/user/794579) 你这dfsp改一下行不行!!!!!!!!!!!!!
你把这改成dp就行了啊,或者用bfs试试,不要随便在讨论区提问,除非是迫不得已的时候,自己上网查一下,也可以看看我的代码啊
我的代码:
```cpp
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int n, m;
int dx[4] = {0, -1, 0, 1}, dy[4] = {1, 0, -1, 0};
int shuru[101][101];
int dp[101][101];
struct node {
int x;
int y;
int h;
} a[10001];
bool Com(node n1, node n2) {
return n1.h < n2.h;
}
int main() {
int res = 0;
cin >> n >> m;
int k = 0;
for (int i = 0; i < n; i ++ )
for (int j = 0; j < m; j ++ ) {
a[k].x = i;
a[k].y = j;
cin >> a[k].h;
shuru[i][j] = a[k].h;
k ++ ;
}
sort(a, a + n * m, Com);
for (int i = 0; i < n * m; i ++ ) {
for (int j = 0; j < 4; j ++ ) {
int f = dx[j] + a[i].x, s = dy[j] + a[i].y;
if (f >= 0 && f < n && s >= 0 && s < m && a[i].h > shuru[f][s]) dp[a[i].x][a[i].y] = max(dp[a[i].x][a[i].y], dp[f][s]+1);
}
res = max(res, dp[a[i].x][a[i].y]);
}
cout << res + 1 << endl;
return 0;
}
```
by ttltony @ 2023-01-31 11:29:06
@[ttltony](/user/709380) ?
by _2735_ @ 2023-01-31 11:37:04
@[_2735_](/user/580202) 怎么了
by ttltony @ 2023-01-31 11:40:35
@[TechnobladePlus](/user/794579) f没赋值
by yinhee @ 2023-01-31 11:41:20
e
我只是想把递归改成递推然后不会
不过栓Q了
@[ttltony](/user/709380)
by Clay_L @ 2023-01-31 11:42:51
@[yinhee](/user/578590) 他输入的时候赋值了
by _2735_ @ 2023-01-31 11:45:31
@[yinhee](/user/578590) 他刚刚给f赋值了,赋了极小值,提交后TLE没有解决,还WA了
by ttltony @ 2023-01-31 11:46:31
你这记忆化没赋值吧
by _2735_ @ 2023-01-31 11:51:14
@[_2735_](/user/580202) ??
by Clay_L @ 2023-01-31 11:52:33
额。。。。
现在的问题是TLE不是WA
by Clay_L @ 2023-01-31 11:53:29