1015. 摘花生

思路： 闫氏dp法

代码：

# include<iostream>
# include<cstdio>
# include<cstring>
# include<algorithm>
using namespace std;

const int N = 110;
int t,r,c;
int a[N][N],f[N][N];

int main()
{
    
    
    cin >> t;
    for(int i = 0;i < t;i++)
    {
    
    
        cin >> r >> c;
        for(int i = 1;i <= r;i++)
        {
    
    
            for(int j = 1;j <= c;j++)
            {
    
    
                cin >> a[i][j];
            }
        }
        for(int i = 1;i <= r;i++)
        {
    
    
            for(int j = 1;j <= c;j++)
            {
    
    
                f[i][j] = max(f[i][j - 1] + a[i][j],f[i - 1][j] + a[i][j]);
            }
        }
        cout << f[r][c] << endl;
    }
    
    return 0;
}