题意:你可以往下走,也可以往右走,然后问你从1,1走到n,m,求路过的和最大可以为多少
思路: dp 注意初始化,有负数
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
const int maxn = 1e3+10;
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
//
int a[maxn][maxn],dp[maxn][maxn];
int main(){
int T=read();
for(int cas=1; cas<=T; cas++){
int n=read(),m=read();
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
a[i][j] = read();
for(int i=0; i<=n; i++)
for(int j=0; j<=m; j++)
dp[i][j] = -INF;
dp[0][1] = 0,dp[1][0] = 0;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++){
// if(i==1)
// dp[i-1][j] = -INF;
// if(j==1)
// dp[i][j-1] = -INF;
// if(i==1 && j==1)
// dp[i-1][j] = 0;
dp[i][j] = max(dp[i-1][j],dp[i][j-1]) + a[i][j];
}
cout << "Case " << cas << ": " << dp[n][m] << endl;
}
return 0;
}
//http://codeforces.com/gym/100500/attachments