View Code of Problem 17

int kuo(int s[20][20],int y[20][20],int i,int j)
{
    int a,b,c,d,m,n;
    a=b=c=d=m=n=0;
    y[i][j]=1;
    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=kuo(s,y,i+1,j)+1;
        if(s[i][j]<s[i-1][j]) b=kuo(s,y,i-1,j)+1;
        if(s[i][j]<s[i][j+1]) c=kuo(s,y,i,j+1)+1;
        if(s[i][j]<s[i][j-1]) d=kuo(s,y,i,j-1)+1;
    }
    m=a>b?a:b;
    n=c>d?c:d;
    return m>n?m:n;
}

int main()
{
    int m,n,i,j,js;
    while(~scanf("%d",&n))
    {
        scanf("%d",&m);
        int s[20][20]={0},y[20][20]={0},step=0;
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
                scanf("%d",&s[i][j]);
        for(i=1;i<=n;i++)
            for(j=1;j<=m;j++)
            {
                if(y[i][j]!=1) js=kuo(s,y,i,j);
                if(js>step) step=js;
            }
        printf("%d\n",step);
    }
    return 0;
}