题目来源 www.acwing.com
分析过程
代码:
#include<iostream>
using namespace std;
int n, m;
int T;
int w[110][110];
int f[110][110];
int main(){
cin >> T;
while(T -- ){
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++){
cin >> 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;
}
return 0;
}