poj1088滑雪

http://poj.org/problem?id=1088

据说这题叫经典记忆化搜索 瞎写了下就过了

#include <iostream>
#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
using namespace std;
#define INF 0xfffffff
int a[110][110],dp[110][110];
int find(int i,int j)
{
    if(dp[i][j])
    return dp[i][j];
    int x=0,y=0,z=0,o=0;
    if(a[i][j]>a[i-1][j])
    x = find(i-1,j)+1;
    if(a[i][j]>a[i+1][j])
    y = find(i+1,j)+1;
    if(a[i][j]>a[i][j-1])
    z = find(i,j-1)+1;
    if(a[i][j]>a[i][j+1])
    o = find(i,j+1)+1;
    if(x||y||z||o)
    return max(max(x,y),max(z,o));
    return 1;
}
int main()
{
    int i,j,k,n,m;
    while(cin>>n>>m)
    {
        int g=0;
        memset(dp,0,sizeof(dp));
        for(i = 0; i <= n+1 ; i++)
            for(j = 0; j <= m+1 ; j++)
            a[i][j] = INF;
        for(i = 1; i <= n ;i++)
            for(j = 1;j <= m ; j++)
                scanf("%d",&a[i][j]);
        int maxz=0;
        for(i = 1; i <= n ; i++)
            for(j = 1; j <= m ;j++)
            {
                dp[i][j] = find(i,j);
                maxz = max(maxz,dp[i][j]);
            }
        cout<<maxz<<endl;
    }
    return 0;
}