> #include <stdio.h>
> 
> #define MAX 102
> #define INFINIT 999999
> 
> int N,M;
> int m[MAX][MAX];
> int h[MAX][MAX]={0};
> 
> int search(int ,int );
> 
> int main() {
> 	int i,j;
> 	int max = 0;
> 	scanf( "%d%d",&M,&N );
> 	for( i=1;i<=M;i++ ) {
> 		for( j=1;j<=N;j++ ) {
> 			scanf( "%d",&m[i][j] );
> 		}
> 	}
> 	for( i=0;i<=N+1;i++ ) {
> 		m[0][i] = INFINIT;
> 		m[M+1][i] = INFINIT;
> 	}
> 
> 	for( j=0;j<=M+1;j++ ) {
> 			m[j][0] = INFINIT;
> 			m[j][N+1] = INFINIT;
> 	}
> 
> 	for( i=1;i<=N;i++ ) {
> 		for( j=1;j<=M;j++ ) {
> 			if( max < search(i,j) ) max = search(i,j);
> 		//	printf( "%d-",search(i,j) );
> 		}
> 		//printf( "\n" );
> 	}
> 
> 	printf( "%d\n",max );
> 
> 	return 0;
> }
> 
> int search( int i,int j) {
> 	int max =1;
> 	int cur = 0;
> 
> 	if( h[i][j] ) return h[i][j];
> 
> 	if( m[i][j] <m[i+1][j] && m[i][j] <m[i-1][j]
> 		&& m[i][j] <m[i][j+1] && m[i][j]<m[i][j-1] ) {
> 		h[i][j] = 1;
> 		return 1;
> 	}
> 
> 	if( m[i][j] > m[i+1][j] ) {
> 		cur = search( i+1,j );
> 		if( max < cur+1 ) max = cur+1;
> 	}
> 
> 	if( m[i][j] > m[i-1][j] ) {
> 		cur = search( i-1,j );
> 		if( max < cur+1 ) max = cur+1;
> 	}
> 
> 	if( m[i][j] > m[i][j+1] ) {
> 		cur = search( i,j+1 );
> 		if( max < cur+1 ) max = cur+1;
> 	}
> 
> 	if( m[i][j] > m[i][j-1] ) {
> 		cur = search( i,j-1 );
> 		if( max < cur+1 ) max = cur+1;
> 	}
> 
> 	h[i][j] = max;
> 	return max;
> }