#include<iostream.h>
int r,c,a[101][101],flag[101][101];
int huaxue(int i,int j)
{
	int temp,max=1;
	if(flag[i][j]!=-1) return flag[i][j];
	if(a[i][j]>a[i-1][j]&&i>1)
	{   temp=huaxue(i-1,j);
	    if(max<temp+1) max=temp+1;
	}
	if(a[i][j]>a[i][j-1]&&j>1)
	{   temp=huaxue(i,j-1);
	    if(max<temp+1) max=temp+1;
	}
	if(a[i][j]>a[i+1][j]&&i<r)
	{   temp=huaxue(i+1,j);
	    if(max<temp+1) max=temp+1;
	}
	if(a[i][j]>a[i][j+1]&&j<c)
	{   temp=huaxue(i,j+1);
	    if(max<temp+1) max=temp+1;
	}
	flag[i][j]=max;
	return max;
}

void main()
{
	int i,j,temp,max=0;
	cin>>r>>c;
	for(i=1;i<=r;i++)
		for(j=1;j<=c;j++)
		{cin>>a[i][j];
		 flag[i][j]=-1;
		}
    for(i=1;i<=r;i++)
		for(j=1;j<=c;j++)
		{temp=huaxue(i,j);
            if(max<temp) max=temp;
		}
    cout<<max<<endl;
}

• Re:0MS的递归 (27) lnmm 2007-09-17 00:35:09
  • Re:0MS的递归 (19) livingroom 2008-02-03 23:45:37
• Re:0MS的递归 (7) goodness 2008-02-17 18:40:09
• Re:0MS的递归 (25) ktty 2008-03-15 17:54:46
• Re:0MS的递归 (900) 10074187 2008-03-29 20:29:27
• Re:0MS的递归 (27) power7k 2008-07-20 23:20:35
• Re:0MS的递归 (5) whuwinnie 2008-07-29 15:21:44
  • Re:0MS的递归 (9) ecjtuzdh 2009-02-10 13:46:05
• Re:0MS的递归 (11) conanhjj 2008-08-23 23:20:32
• Re:0MS的递归 (900) 153596678 2008-09-17 17:34:50
• Re:0MS的递归 (18) jackiedu 2008-09-18 10:03:07