Acwing 901. 滑雪

状态表示：f[i][j]表示所有从(i, j)开始滑的路径中的最大值

状态计算：按照第一步是向哪个方向滑的，将集合划分为四个部分

 

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 310;

int f[N][N], h[N][N];
int n, m;

int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

int dp(int x, int y)
{
    if (f[x][y] != -1) return f[x][y];
    
    f[x][y] = 1;
    for (int i = 0; i < 4; ++ i)
    {
        int a = x + dx[i];
        int b = y + dy[i];
        
        if (a >= 1 && a <= n && b >= 1 && b <= m && h[a][b] < h[x][y])
            f[x][y] = max(f[x][y], dp(a, b) + 1);
    }
    
    return f[x][y];
}

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++ i)
        for (int j = 1; j <= m; ++ j)
            cin >> h[i][j];
    
    memset(f, -1, sizeof(f));
            
    int res = 0;
    for (int i = 1; i <= n; ++ i)
        for (int j = 1; j <= m; ++ j)
            res = max(res, dp(i, j));
            
    cout << res << endl;
    
    return 0;
}