BZOJ 3997: [TJOI2015]组合数学

#include<bits/stdc++.h>
using namespace std;
const int N=1005;
inline int read(){
char ch=getchar(); int x=0,f=1;
while(ch<'0'||ch>'9'){if(ch=='-')f=-1; ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0'; ch=getchar();}
return x*f;
}
int f

,a

;
int main()
{
int T=read();
while(T--){
int n=read(),m=read(),i,j;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++)f[i][j]=a[i][j]=read(); f[i][j]=0;
}
for(i=1;i<=n;i++)for(j=m;j>0;j--)
f[i][j]=max(max(f[i-1][j],f[i][j+1]),a[i][j]+f[i-1][j+1]);
printf("%d\n",f
[1]);
}
return 0;
}