bzoj3997

题解：

ｄｐ

f[i][j]=max(f[i-1][j+1]+a[i][j],max(f[i-1][j],f[i][j+1]));

代码：

#include<bits/stdc++.h>
using namespace std;
const int N=;
int T,n,m,a[N][N],f[N][N];
int main()
{
    scanf("%d",&T);
    while (T--)
     {
        scanf("%d%d",&n,&m);
        for (int i=;i<=n;i++)
         for (int j=;j<=m;j++)scanf("%d",&a[i][j]);
        for (int i=;i<=n;i++)
         for (int j=m;j;j--)
          f[i][j]=max(f[i-][j+]+a[i][j],max(f[i-][j],f[i][j+]));
        printf("%d\n",f[n][]);
     }
    return ;
}