朱世奇菜！朱世奇菜！朱世奇菜！朱世奇菜！

#include<iostream>
#include<cstdio>
using namespace std;
int n,m;
int a[105][105];
int ans = 0;
int dx[5] = {0, 0, -1, 1}, dy[5] = {1, -1,0, 0};
int f[105][105];
int dfs(int x, int y)
{
	if (f[x][y]) return f[x][y];
	int len = 1;
	for (int i = 0;i <= 3;i++)
	{
		int nx = x + dx[i], ny = y + dy[i];
		if (nx < 1 || ny < 1 || nx > n || ny > m) continue;
		if (a[nx][ny] >= a[x][y]) continue;
		len = max(len, dfs(nx, ny) + 1);
		dfs(nx, ny);
	}
	return f[x][y] = len;
}
int main()
{
	cin >> n >> m;
	for (int i = 1;i <= n;i++)
	{
		for (int j = 1;j <= m;j++)
		{
			cin >> a[i][j];
		}
	}
	for (int i = 1;i <= n;i++)
	{
		for (int j = 1;j <= m;j++)
		{
			ans = max(ans, dfs(i, j));
		}
	}
	cout << ans;
    return 0;
}