poj 1088 (dp记忆化搜索）

#include<cstdio>

#define M 105

int dp[M][M],a[M][M],n,m,step[8]={0,1,0,-1,1,0,-1,0};

int solve(int i,int j){
	if(dp[i][j] || i>n || i<1 || j>m || j<1)
		return dp[i][j];
	int max=0,temp;
	for(int k=0;k<8;k+=2){
		int x=i+step[k];
		int y=j+step[k+1];
		if(a[i][j]>a[x][y])
			temp=solve(x,y),max=max>temp?max:temp;
	}
	return dp[i][j]=max+1;
		
}
int main(){
	
	while(~scanf("%d %d",&n,&m)){
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				scanf("%d",&a[i][j]),dp[i][j]=0;
		int max=0;
			for(int k=1;k<=n;k++){
				for(int p=1;p<=m;p++){
					solve(k,p);
					max=max>dp[k][p]?max:dp[k][p];
				}
			}
		printf("%d\n",max);
	}
}