P2380 狗哥采矿

 #include<iostream>
 #include<algorithm>
 #include<cstring>
 const int maxn=;
 using namespace std;
 int n,m;
 int dp[maxn][maxn];
 int a[maxn][maxn];
 int b[maxn][maxn];
 int sum1[maxn][maxn];
 int sum2[maxn][maxn];
 int main()
 {
     cin>>n>>m;
     while(m!=||n!=)
     {
         memset(a,,sizeof(a));
         memset(b,,sizeof(b));
         memset(sum1,,sizeof(sum1));
         memset(sum2,,sizeof(sum2));
         memset(dp,,sizeof(dp));
         for(int i=;i<=n;i++)
         {
             for(int j=;j<=m;j++)
             {
                 cin>>b[i][j];
                 sum1[i][j]=sum1[i][j-]+b[i][j];
             }
         }
         for(int i=;i<=n;i++)
         {
             for(int j=;j<=m;j++)
             {
                 cin>>a[i][j];
                 sum2[i][j]=sum2[i-][j]+a[i][j];
             }
         }
         for(int i=n;i>=;i--)
         {
             for(int j=m;j>=;j--)
             {
                     dp[i][j]=max(dp[i][j+]+sum2[i][j+],dp[i+][j]+sum1[i+][j]);
             }
         }
         cout<<dp[][]<<endl;
         cin>>n>>m;
     }
     return ;
  }