笔记

代码

#include<iostream>
#include<cstring>
using namespace std;
const int N = 110;
int n, m, f[N][N], w[N][N];

int main()
{
    int t; 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;
}