【题解】LuoGu7074：方格取数

原题传送门
普及的题目就直接秒杀了
因为题目已经帮我们划好了dp的阶段，就是一列一列的走
然后在一列里面可以分为向上走和向下走，那么我需要知道上一个阶段每个地方的最优值，用dp数组记录下来，很套路得转移就行了

Code：

#include <bits/stdc++.h>
#define maxn 1010
#define LL long long
using namespace std;
const LL inf = 1e12;
LL a[maxn][maxn], f[maxn], g[maxn], n, m;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

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) f[i] = f[i - 1] + a[i][1];
	for (int i = 2; i <= m; ++i){
		LL down = f[1] + a[1][i];
		g[1] = max(-inf, down);
		for (int j = 2; j <= n; ++j){
			down = max(down, f[j]) + a[j][i];
			g[j] = max(-inf, down);
		}
		LL up = f[n] + a[n][i];
		f[n] = max(g[n], up);
		for (int j = n - 1; j; --j){
			up = max(up, f[j]) + a[j][i];
			f[j] = max(g[j], up);
		}
	}
	printf("%lld\n", f[n]);
	return 0;
}