洛谷 P1434 [SHOI2002]滑雪（记忆化搜索）

原题链接

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
#include <cstring>
#include <string.h>
#include <queue>
#define ll long long
#include<set>
using namespace std;
const ll inf = 0x3f3f3f3f;
inline ll read() {
    ll k = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { k = k * 10 + ch - '0'; ch = getchar(); }return k * f;
}

ll a[105][105];
ll dp[105][105];
ll gox[4] = { 0,0,1,-1 };
ll goy[4] = { 1,-1,0,0 };
ll n, m;
void dfs(ll x, ll y)
{
    if (dp[x][y] > 0)return;
    dp[x][y] = 1;
    for (int i = 0; i < 4; i++)
    {
        ll xx = x + gox[i];
        ll yy = y + goy[i];
        if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && a[xx][yy] < a[x][y])
        {
            dfs(xx, yy);
            dp[x][y] = max(dp[x][y], dp[xx][yy] + 1);
        }
    }
}
int main()
{
    n = read(), m = read();
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            a[i][j] = read();
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            dfs(i, j);
        }
    }
    ll ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            ans = max(ans, dp[i][j]);
        }
    }
    cout << ans << '\n';
}