Memory search AcWing 901. skiing

Original link

AcWing 901. skiing

Algorithm tags

Dynamic programming Memory search

Ideas

Code

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 305;
int a[N][N],f[N][N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int n, m;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
int dp(int x, int y){
    if(f[x][y]!=-1){
        return f[x][y];
    }
    f[x][y]=1;
    rep(i, 0, 4){
        int xx=x+dx[i], yy=y+dy[i];
        if(xx>=1&&xx<=n&&yy>=1&&yy<=m&&a[xx][yy]<a[x][y]){
            f[x][y]=max(f[x][y], dp(xx, yy)+1);
        }
    }
    return f[x][y];
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    n=read(), m=read();
    rep(i, 1, n+1){
        rep(j, 1, m+1){
            a[i][j]=read();
        }
    }
    memset(f, -1, sizeof f);
    int ans=0;
    rep(i, 1, n+1){
        rep(j, 1, m+1){
            ans=max(ans, dp(i, j));
        }
    }
    printf("%lld", ans);
    return 0;
}

Originality is not easy.
Reprint please indicate the source
If it helps you Don't forget to praise and support