#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<string>
using namespace std;
const int INF=0x3f3f3f3f;
const int MAXN=100+5;
int map[MAXN][MAXN];
int num[MAXN][MAXN];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int n,m;
bool is_ill(int x,int y)
{
if(x<0||x>=n||y<0||y>=m)return 1;
return 0;
}
int solve(int x,int y)
{
if(num[x][y])return num[x][y];
int i,key,sum=0;
for(i=0;i<4;i++)
{
int curx=x+dx[i];
int cury=y+dy[i];
if(is_ill(curx,cury)||map[curx][cury]>=map[x][y])continue;
if((key=solve(curx,cury))>sum)sum=key;
}
return num[x][y]=sum+1;
}
int main()
{
//freopen("123.txt","r",stdin);
int i,j;
while(~scanf("%d%d",&n,&m))
{
int max=0;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
scanf("%d",&map[i][j]);
if(max<map[i][j])max=map[i][j];
}
memset(num,0,sizeof(num));
int key,ans=0;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
if((key=solve(i,j))>ans)ans=key;
printf("%d\n",ans);
}
return 0;
}
POJ 1088(水记忆化搜索)
最新推荐文章于 2021-02-23 11:49:49 发布