View Code of Problem 17

#include<stdio.h>
int climb(int s[100][100],int i,int j) {
	int a,b,c,d;
	a=b=c=d=0;
	if(s[i][j]>s[i+1][j]&&s[i][j]>s[i-1][j]&&s[i][j]>s[i][j+1]&&s[i][j]>s[i][j-1])
		return 0;
	else {
		if(s[i][j]<s[i+1][j]) a=climb(s,i+1,j)+1;
		if(s[i][j]<s[i-1][j]) b=climb(s,i-1,j)+1;
		if(s[i][j]<s[i][j+1]) c=climb(s,i,j+1)+1;
		if(s[i][j]<s[i][j-1]) d=climb(s,i,j-1)+1;
	}
	return (a>b?a:b)>(c>d?c:d)?(a>b?a:b):(c>d?c:d);
}
int main() {
	int n,m,i,j,step=0;
	while(~scanf("%d %d",&n,&m)) {
		int a[100][100]={0},sum=0;
		for(i=1; i<=n; i++) {
			for(j=1; j<=m; j++) {
				scanf("%d",&a[i][j]);
			}
		}
		for(i=1; i<=n; i++) {
			for(j=1; j<=m; j++) {
				step=climb(a,i,j);
				if(step>sum)
					sum=step;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}