5 solutions

  • 1
    @ 2025-3-29 10:17:18
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1010;
    int c[N][N],f[N][N];
    int main()
    {
    	int n;
    	cin>>n;
    	while(n--)
    	{
    		int a,b;
    		cin>>a>>b;
    		for(int i=1;i<=a;i++)
    		{
    			for(int j=1;j<=b;j++)
    			{
    				cin>>c[i][j];
    			}
    		}
    	memset(f,-0x3f ,sizeof f);	
    	f[0][1]=0;
    	
    		for(int i=1;i<=a;i++)
    		{
    			for(int j=1;j<=b;j++)
    			{
    				f[i][j]=max(f[i-1][j],f[i][j-1])+c[i][j];
    			}
    		}
    		cout<<f[a][b]<<endl;
    	}
    	
        return 0;     
    }
    
    

    Information

    ID
    974
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    (None)
    # Submissions
    40
    Accepted
    14
    Uploaded By