1015. 摘花生

#include <iostream>
#include <algorithm>
using namespace std;
const int N=105;
int a[N][N];
int dp[N][N];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int r,c;
        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++)
                dp[i][j]=max(dp[i-1][j],dp[i][j-1])+a[i][j];
        cout<<dp[r][c]<<'\n';
    }
    return 0;
}

标签：std,main,const,int,cin,花生,1015,include
来源： https://blog.csdn.net/qq12323qweeqwe/article/details/122299903