[BZOJ3997][TJOI2016]组合数学 平面图

平面图相关
从左下扫到右上即可

#include <iostream>#include <cstdio>#include <cstring>#define N 1050using namespace std;typedef long long LL;int v[N][N],n,m;LL F[N][N];void ut(LL &x,LL y) { x = max(x,y); }int main() {    int T = 0; scanf("%d",&T);    while (T--) {        scanf("%d%d",&n,&m);        for (int i=1;i<=n;i++)             for (int j=1;j<=m;j++) scanf("%d",&v[i][j]);        for (int i=1;i<=n;i++)            for (int j=1;j<=m;j++) F[i][j] = 0LL;        for (int i=n;i>=1;i--)            for (int j=1;j<=m;j++) {                ut(F[i][j] , F[i+1][j]);                ut(F[i][j] , F[i][j-1]);                ut(F[i][j] , F[i+1][j-1] + v[i][j]);            }        printf("%lld\n",F[1][m]);    }    return 0;}