POJ 1088 DP

题意

传送门 POJ1088

题解

$dp[i][j]$ 代表 $(i,j)$ 为终点的最长滑雪路径，$(i^{\prime },j^{\prime })$ 代表路径上的前一滑雪地点
d p [ i ] [ j ] = m a x h [ i ] [ j ] < h [ i ′ ] [ j ′ ] { d p [ i ′ ] [ j ′ ] } + 1 dp[i][j]=max_{h[i][j]<h[i'][j']}\{dp[i'][j']\}+1 dp[i][j]=maxh[i][j]<h[i′][j′]​{dp[i′][j′]}+1

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 105
int dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
int R, C, h[maxn][maxn], dp[maxn][maxn];

int rec(int x, int y)
{
    if (dp[x][y] != -1)
        return dp[x][y];
    int res = 0;
    for (int i = 0; i < 4; i++)
    {
        int nx = x + dx[i], ny = y + dy[i];
        if (nx >= 0 && nx < R && ny >= 0 && ny < C && h[x][y] < h[nx][ny])
        {
            res = max(res, rec(nx, ny));
        }
    }
    return dp[x][y] = res + 1;
}

int main()
{
    while (~scanf("%d%d", &R, &C))
    {
        for (int i = 0; i < R; i++)
        {
            for (int j = 0; j < C; j++)
            {
                scanf("%d", &h[i][j]);
            }
        }
        memset(dp, -1, sizeof(dp));
        int res = 0;
        for (int i = 0; i < R; i++)
        {
            for (int j = 0; j < C; j++)
            {
                res = max(res, rec(i, j));
            }
        }
        printf("%d\n", res);
    }
    return 0;
}