1015. picking flowers

subject ：

Hello Kitty I want to pick some peanuts for her favorite Mickey Mouse .

She came to a rectangular peanut field with a grid of roads ( Here's the picture ), Go in from the northwest corner , Come out from the southeast corner .

There is a peanut seedling growing at the intersection of every road in the field , There are some peanuts on it , After a peanut seedling, you can pick all the peanuts on it .

Hello Kitty You can only go east or South , You can't go west or North .

ask Hello Kitty How many peanuts can you pick at most .

Input format ：

The first line is an integer T, Represents how many sets of data there are .

Next is T Group data .

The first row of each set of data is two integers , They represent the rows of peanut seedlings R And number of columns C.

Next for each group of data R Row data , Describe each row of peanut seedlings from north to south . Each row of data has C It's an integer , The number of peanuts per plant in the row is described from west to East M.

Output format ：

Enter data for each group , Output one line , The content is Hello Kitty The number of peanuts that can be picked the most .

Data range ：

sample input ：

2
2 2
1 1
3 4
2 3
2 3 4
1 6 5

sample output ：

8
16

Ideas ：

AC Code ：

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

const int N = 110;
int n,m;
int w[N][N];
int f[N][N];
int t;
int main()
{
    
    scanf("%d",&t);
    while(t--)
    {
    
        scanf("%d%d",&n,&m);
        for(int i = 1;i<=n;i++)
          for(int j = 1;j<=m;j++)
          {
    
              scanf("%d",&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];
            }

            printf("%d\n",f[n][m]);
    }
    return 0;
}