第二个点wa了，90分哭出来

#include<cstdio> 
#include<cmath>
#include<algorithm>
#include<iostream>
#define f(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
inline int re()
 {
    char c=getchar();int res=0,b=1;
    while(c!='-' && ( c<'0' || c>'9' ) ) c=getchar();
    if(c=='-') b=-b,c=getchar();
    while(c>='0' && c<='9') res=(res<<1)+(res<<3)+c-'0',c=getchar();
    return res*b;
 }
int chen[103][103],yi[103][103],n,m,ans;
void dfs(int i,int j)
 {
   if(i<1 || j<1 || i>m || j>n) return ;
   if(yi[i+1][j]<yi[i][j]) {if(!chen[i+1][j]) dfs(i+1,j);chen[i][j]=max(chen[i][j],chen[i+1][j]);}
   if(yi[i-1][j]<yi[i][j]) {if(!chen[i-1][j]) dfs(i-1,j);chen[i][j]=max(chen[i][j],chen[i-1][j]);}
   if(yi[i][j+1]<yi[i][j]) {if(!chen[i][j+1]) dfs(i,j+1);chen[i][j]=max(chen[i][j],chen[i][j+1]);}
   if(yi[i][j-1]<yi[i][j]) {if(!chen[i][j-1]) dfs(i,j-1);chen[i][j]=max(chen[i][j],chen[i][j-1]);}
   chen[i][j]++; ans=max(ans,chen[i][j]);
 }
 int main()
  {
    n=re(),m=re();
    f(i,1,m) f(j,1,n) yi[i][j]=re();
    f(i,1,m) f(j,1,n) if(!chen[i][j]) dfs(i,j);
    f(i,1,m) f(j,1,n) cout<<chen[i][j]<<endl; 
    cout<<ans;
    return 0;
  }