UVA 1366 九 Martian Mining

Martian Mining

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice UVA 1366

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

    int dp[505][505][3];
int main()
{
    int n,m;
    int sumY[505][505],sumB[505][505];
    int i,j,k,x,y;
    while(scanf("%d %d",&n,&m)!=EOF && n!=0 && m!=0)
    {
        memset(sumY,0,sizeof(sumY));
        memset(sumB,0,sizeof(sumB));
        memset(dp,0,sizeof(dp));
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                scanf("%d",&x);
                sumY[i][j]=sumY[i][j-1]+x;
            }
        }
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                scanf("%d",&y);
                sumB[i][j]=sumB[i-1][j]+y;
            }
        }

        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                dp[i][j][1]=max(dp[i-1][j][1],dp[i-1][j][2])+sumY[i][j];
                dp[i][j][2]=max(dp[i][j-1][1],dp[i][j-1][2])+sumB[i][j];
            }
        }
        printf("%d
",max(dp[i-1][j-1][1],dp[i-1][j-1][2]));
    }
    return 0;
}