TLE#2，求调

#include <bits/stdc++.h>
using namespace std;

int m, n, a[202][202], s = INT_MIN;

int dx[] = {0, 1, 0, -1}, dy[] = {-1, 0, 1, 0}, c = 0;

void dfs(int x, int y, int l) {
    s = max(l, s);
    for (int i = 0; i < 4; i++) {
        int nx = x + dx[i], ny = y + dy[i];
        if (nx >= 1 && nx <= n && ny >= 1 && ny <= m && a[nx][ny] < a[x][y]) {
            dfs(nx, ny, l + 1);
        }
    }
}

int main() {
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%d", &a[i][j]);
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dfs(i, j, 1);
        }
    }
    printf("%d", s);
    return 0;
}