POJ 1088滑雪（记忆化）

滑雪

#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
const int maxr = 110;
int map[maxr][maxr];
int dp[maxr][maxr];
int r, c, h;
int to[4][2] = {1,0,-1,0,0,1,0,-1};

bool valid(int x, int y) {
    if(x < 0 || x >= r || y < 0 || y >= c)
        return 0;
    return 1;
}

int dfs(int x, int y) {
    if(dp[x][y])
        return dp[x][y];

    int i, j;
    int len = 0;
    for(i = 0; i < 4; ++i) {

        int xx = x + to[i][0];
        int yy = y + to[i][1];

        if(!valid(xx,yy) || map[xx][yy] >= map[x][y])
            continue;
        len = max(len, dfs(xx, yy));

    }

    dp[x][y] = len + 1;
    return dp[x][y];
}

int main() {
    //freopen("data.in", "r", stdin);
    scanf("%d %d", &r, &c);
    int i, j, h;

    for(i = 0; i < r; ++i) {
        for(j = 0; j < c; ++j) {
            scanf("%d", &h);
            map[i][j] = h;
            dp[i][j] = 0;
        }
    }

    int ans = 0;
    for(i = 0; i < r; ++i) {
        for(j = 0; j < c; ++j) {
            ans = max(ans, dfs(i, j));
        }
    }

    printf("%d\n", ans);
    return 0;
}