AcWing 1015. 摘花生
原题链接
简单
作者:
chenjiaqiy
,
2023-12-06 19:46:48
,
所有人可见
,
阅读 63
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 110,inf = 1e9;
int n,m;
int _;
int w[N][N];
int f[N][N];
int main()
{
scanf("%d", &_);
while(_ -- )
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ ) scanf("%d", &w[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]) + w[i][j];
}
cout << f[n][m] << endl;
}
}
这代码很迷