求求大佬指正，代码通俗易懂1. ```

include "bits/stdc++.h"

using namespace std; int f[105][105],m,n,sum,ans=0; void dfs(int a,int b,int c) {int ok=0,okk=0,okkk=0; if(f[a-1][b]>f[a][b]&&(a-1)>=1&&(a-1)<=m&&b>=1&&b<=n) {c++; dfs(a-1,b,c); ok=1; } else {ans=max(ans,c); } if(f[a+1][b]>f[a][b]&&(a+1)>=1&&(a+1)<=m&&b>=1&&b<=n) {c++; if(ok) c--; okk=1; dfs(a+1,b,c); } else {ans=max(ans,c); } if(f[a][b+1]>f[a][b]&&(a)>=1&&(a)<=m&&(b+1)>=1&&(b+1)<=n) {c++; if(ok) c--; if(okk) c--; okkk=1; dfs(a,b+1,c); } else {ans=max(ans,c); } if(f[a][b-1]>f[a][b]&&(a)>=1&&(a)<=m&&(b-1)>=1&&(b-1)<=n) {c++; if(ok) c--; if(okk) c--; if(okkk) c--; dfs(a,b-1,c); } else {ans=max(ans,c); } return; } int main() {cin>>m>>n; for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) cin>>f[i][j]; for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) dfs(i,j,1); cout<<ans; return 0; }

#include "bits/stdc++.h"
using namespace std;
int f[105][105],m,n,sum,ans=0;
void dfs(int a,int b,int c)
{int ok=0,okk=0,okkk=0;
if(f[a-1][b]>f[a][b]&&(a-1)>=1&&(a-1)<=m&&b>=1&&b<=n) 
{c++;
dfs(a-1,b,c);
ok=1;
}
else
{ans=max(ans,c);
}
if(f[a+1][b]>f[a][b]&&(a+1)>=1&&(a+1)<=m&&b>=1&&b<=n) 
{c++;
if(ok) c--;
okk=1;
dfs(a+1,b,c);
}
else
{ans=max(ans,c);
}
if(f[a][b+1]>f[a][b]&&(a)>=1&&(a)<=m&&(b+1)>=1&&(b+1)<=n) 
{c++;
if(ok) c--;
if(okk) c--;
okkk=1;
dfs(a,b+1,c);
}
else
{ans=max(ans,c);
}
if(f[a][b-1]>f[a][b]&&(a)>=1&&(a)<=m&&(b-1)>=1&&(b-1)<=n) 
{c++; 
if(ok) c--;
if(okk) c--;
if(okkk) c--;
dfs(a,b-1,c);
}
else
{ans=max(ans,c);
}
return;
}
int main()
{cin>>m>>n;
   for(int i=1;i<=m;i++)
   for(int j=1;j<=n;j++)
   cin>>f[i][j];
   for(int i=1;i<=m;i++)
   for(int j=1;j<=n;j++) 
   dfs(i,j,1);
   cout<<ans;
    return 0;
}