标签：des blog io strong for div sp log on
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 77423 | Accepted: 28779 |
Description
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
Input
Output
Sample Input
5 5 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9
Sample Output
25
记忆化搜索
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=101;
int down[maxn][maxn];
int n,m;
int maz[maxn][maxn];
const int dx[4]={0,0,-1,1};
const int dy[4]={1,-1,0,0};
int dfs(int sx,int sy){
if(down[sx][sy]!=-1)return down[sx][sy];
int tmp=1;
for(int i=0;i<4;i++){
int tx=sx+dx[i],ty=sy+dy[i];
if(tx>=0&&tx<n&&ty>=0&&ty<m&&maz[tx][ty]<maz[sx][sy]){
int t=dfs(tx,ty);
tmp=max(t+1,tmp);
}
}
return down[sx][sy]=tmp;
}
int main(){
while(scanf("%d%d",&n,&m)==2){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%d",maz[i]+j);
}
}
memset(down,-1,sizeof(down));
int ans=0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(down[i][j]==-1){
int tmp=dfs(i,j);
ans=max(ans,tmp);
}
}
}
printf("%d\n",ans);
}
return 0;
}
标签：des blog io strong for div sp log on
原文地址：http://www.cnblogs.com/xuesu/p/3983094.html
