1015. 摘花生

https://www.acwing.com/problem/content/description/1017/

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int N = 1005;
int m[N][N];
int f[N][N];
int t, r, c;
int main()
{
	cin >> t;
	while (t--)
	{
		scanf("%d%d", &r, &c);
		for (int i = 1; i <= r; i++)
			for (int j = 1; j <= c; j++)
				scanf("%d", &m[i][j]);
		for (int i = 1; i <= r; i++)
			for (int j = 1; j <= c; j++)
			{
				f[i][j]=max(f[i-1][j],f[i][j-1])+m[i][j];
			}
		cout << f[r][c] << endl;
	}
	return 0;
}