【洛谷 1508】 Likecloud-吃、吃、吃

思路

数字三角形变式，每个点从上边、左上和右上转移而来。

代码

#include <iostream>
#include <cstdio>
using namespace std;
const int inf = 1e9;
int a1[210][210], f[210][210], n, m;
int b1[] = {0,-1,-1,-1,0};
int b2[] = {0,0,1,-1,0};
bool vis[210][210];
int dfs(int x, int y){
    if(x < 1 || y > m || y < 1) return 0;
    if(f[x][y] != -inf) return f[x][y];
    int ans = -inf;
    for(int i = 1; i <= 3; i ++)
        ans = max(ans, dfs(x+b1[i], y+b2[i]));
    return f[x][y] = ans + a1[x][y];
}
int main(){
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
            scanf("%d", &a1[i][j]);
    for(int i = 1; i <= n+1; i ++)
        for(int j = 1; j <= m+1; j ++)
            f[i][j] = -inf;
    printf("%d", dfs(n+1 ,(m/2)+1));
    return 0;
}