f[i][j] = max(f[i - 1][j], f[i][j - 1]) + a[i][j];
f[i][j]: 从(1, 1)到(i, j) 路线的最大值
// DP
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 110;
int f[N][N], n, m, k;
int main()
{
cin >> k;
while(k--)
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
cin >> f[i][j];
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
f[i][j] = max(f[i - 1][j], f[i][j - 1]) + f[i][j];
cout << f[n][m] << endl;
}
return 0;
}
// 记忆化搜索
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 110;
int a[N][N], f[N][N], n, m, k;
int DFS(int i, int j)
{
if(i == 1 && j == 1) return f[i][j] = a[i][j];
if(f[i][j]) return f[i][j];
int f1 = i - 1 >= 1 ? DFS(i - 1, j) : 0;
int f2 = j - 1 >= 1 ? DFS(i, j - 1) : 0;
f[i][j] = max(f1, f2) + a[i][j];
return f[i][j];
}
int main()
{
cin >> k;
while(k--)
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
cin >> a[i][j];
memset(f, 0, sizeof f);
cout << DFS(n, m) << endl;
}
return 0;
}