洛谷 P1508 Likecloud-吃、吃、吃 （记忆搜/dp

题目链接

https://www.luogu.org/problemnew/show/P1508

题意：

很裸的dp思想， 这里用记忆化搜索从上向下的搜索储存 递推的写法更加方便

记忆化搜索

#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1


typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)1e3+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

void F() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
}

struct node {
    ll a,b,c;
}p[MAXN];
bool cmp(const node &x,const node &y) {
    return x.c*y.b<y.c*x.b;
}

int dp[MAXN][MAXN];
int a[MAXN][MAXN];
int n,m;

int  dfs(int x,int y) {
    if(dp[x][y]!=-1) return dp[x][y];
    if(x==1) return dp[x][y]=a[x][y];
    repp(i,-1,1) {
        if(y+i>=1 && y+i<=m && x-1>=1)
            dp[x][y] = max(dp[x][y], dfs(x-1,y+i)+a[x][y]);
    }
    return dp[x][y];
}
int main() {
    cpp_io();
    CLR(dp, -1);
    cin>>n>>m;
    repp(i,1,n) repp(j,1,m) cin>>a[i][j];
//    repp(i,1,n) {
//        repp(j,1,m)
//            dp[i][j]=max(dp[i-1][j],max(dp[i-1][j-1],dp[i-1][j+1]))+a[i][j];
//    }
    int p=m/2+1;
    dfs(n+1, p);
    cout<<max(max(dp[n][p], dp[n][p-1]), dp[n][p+1])<<"\n";
    return 0;
}

递推：

#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1


typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)1e3+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

void F() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
}

struct node {
    ll a,b,c;
}p[MAXN];
bool cmp(const node &x,const node &y) {
    return x.c*y.b<y.c*x.b;
}
int n,t;
int dp[MAXN][MAXN];
int a[MAXN][MAXN];
int main() {
    cpp_io();
    int n,m; cin>>n>>m;
    repp(i,1,n) repp(j,1,m) cin>>a[i][j];
    repp(i,1,n) {
        repp(j,1,m)
            dp[i][j]=max(dp[i-1][j],max(dp[i-1][j-1],dp[i-1][j+1]))+a[i][j];
    }
    int p=m/2+1;
    cout<<max(max(dp[n][p], dp[n][p-1]), dp[n][p+1])<<"\n";
    return 0;
}