#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d %d",&n,&m);
int a[n][m];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
scanf("%d",&a[i][j]);
int dp[n][m] = {0};
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(i == 0)
{
if(j == 0)
dp[i][j] = a[i][j];
else
dp[i][j] = dp[i][j-1]+a[i][j];
}
else if(j == 0)
{
dp[i][j] = dp[i-1][j] + a[i][j];
}
else
dp[i][j] = max(dp[i-1][j],dp[i][j-1])+a[i][j];
}
}
printf("%d\n",dp[n-1][m-1]);
}
return 0;
}
入门DP
DP[i][j] = max(DP[i-1][j],DP[i][j-1])+a[i][j];
因为ij这个点只能由i-1,j和i,j-1达到