AcWing每日一题--摘花生

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

#include<iostream>
using namespace std;
const int N=110;
int w[N][N],f[N][N];
int main(void){
    int t;
    cin>>t;
    while(t--){
        int n,m;
        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]+w[i][j],f[i][j-1]+w[i][j]);
            }
        }
        cout<<f[n][m]<<endl;
    }
    return 0;
}