【BZOJ】3997: [TJOI2015]组合数学

#include<stdio.h>
#include<algorithm>
#include<cstring>
#define N 1005
using namespace std;

int n,m,f

,a

,op,T;

int main()
{
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",a[i]+j);
memset(f,0,sizeof(f));
for (int i=n;i;i--) for (int j=1;j<=m;j++) f[i][j]=max(f[i+1][j-1]+a[i][j],max(f[i+1][j],f[i][j-1]));
int op=0;
for (int i=1;i<=n;i++) op=max(op,f[i][m]);
for (int i=1;i<=m;i++) op=max(op,f[1][i]);
printf("%d\n",op);
}
}