题面
题解
我们可以将 f[i] [j] 集合划分为4个状态,从上下左右四个方向走,就拿向右来说,向右是 f[i] [j-1] 如果可以,那么就是 f[i] [j-1] +1 ( (i,j-1)经过的点再加上 (i,j)这个点);如何求f[i][j-1] 经过的点最多,那么继续往前推即可
代码
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 310;
int n, m;
int h[N][N];
int f[N][N];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int dp(int i, int j) {
if (f[i][j] != -1) return f[i][j];
f[i][j] = 1; //最开始肯定有自己
for (int k = 0; k < 4; k++) {
int x = i + dx[k], y = j + dy[k];
if (x >= 1 && x <= n && y >= 1 && y <= m && h[i][j] > h[x][y]) {
f[i][j] = max(f[i][j], dp(x, y) + 1);
}
}
return f[i][j];
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> h[i][j];
}
}
memset(f, -1, sizeof f);
int res = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
res = max(res, dp(i, j));
}
}
cout << res << endl;
return 0;
}