全部WA了

code:

#include<iostream>
#include<algorithm>
using namespace std;
int a[105][105];
int f[105][105];
int n, m;
int dx[4] = { 0,1,-1,0 };
int dy[4] = { -1,0,0,1 };
int dfs(int x, int y) {
    cout << x << ' ' << y << endl;
    if (f[x][y])return f[x][y];
    f[x][y] = 1;
    for (int i = 0; i < 4; i++) {
        int xx = dx[i] + x;
        int yy = dx[i] + y;
        if (xx > 0 && xx < n && yy>0 && yy<m && a[x][y]>a[xx][yy]) {
            f[xx][yy] = dfs(xx, yy);
            f[x][y] = max(f[x][y], f[xx][yy] + 1);
        }
    }
    return f[x][y];
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    int ans = -1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            ans = max(ans, dfs(i, j));
        }
    }
    cout << ans << endl;
    return 0;
}