寻找最长区域(代码)

#include "stdio.h"
int R,C,map[105][105],m[105][105]={0};

int dfs(int i,int j){

int k;
if(m[i][j]){
return m[i][j];
}
if(i!=0&&map[i-1][j]<map[i][j]){
k=dfs(i-1,j)+1;
if(k>m[i][j]){m[i][j]=k;}
}
if(i!=R-1&&map[i+1][j]<map[i][j]){
k=dfs(i+1,j)+1;
if(k>m[i][j]){m[i][j]=k;}
}
if(j!=0&&map[i][j-1]<map[i][j]){
k=dfs(i,j-1)+1;
if(k>m[i][j]){m[i][j]=k;}
}
if(j!=C-1&&map[i][j+1]<map[i][j]){
k=dfs(i,j+1)+1;
if(k>m[i][j]){m[i][j]=k;}
}
return m[i][j];
}
int main(){
int i,j,k,sum=0;
scanf("%d%d",&R,&C);
for(i=0;i<R;i++){
for(j=0;j<C;j++){
scanf("%d",&map[i][j]);}
}
for(i=0;i<R;i++){
for(j=0;j<C;j++){
k=dfs(i,j);
if(k>sum){
sum=k;}}
}
sum+=1;
printf("%d",sum);
return 0;
}