UVA 13,669 Martian Mining

Martian Mining

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

SubmitStatusPracticeUVA 1366

1#include <stdio.h>2#include <string.h>3#include <algorithm>4 using namespacestd;5 6     intdp[505][505][3];7 intMain ()8 {9     intn,m;Ten     intsumy[505][505],sumb[505][505]; One     inti,j,k,x,y; A      while(SCANF ("%d%d", &n,&m)!=eof && n!=0&& m!=0) -     { -memset (SumY,0,sizeof(SumY)); thememset (Sumb,0,sizeof(Sumb)); -Memset (DP,0,sizeof(DP)); -          for(i=1; i<=n;i++) -         { +              for(j=1; j<=m;j++) -             { +scanf"%d",&x); Asumy[i][j]=sumy[i][j-1]+x; at             } -         } -          for(i=1; i<=n;i++) -         { -              for(j=1; j<=m;j++) -             { inscanf"%d",&y); -sumb[i][j]=sumb[i-1][j]+y; to             } +         } -  the          for(i=1; i<=n;i++) *         { $              for(j=1; j<=m;j++)Panax Notoginseng             { -dp[i][j][1]=max (dp[i-1][j][1],dp[i-1][j][2])+Sumy[i][j]; thedp[i][j][2]=max (dp[i][j-1][1],dp[i][j-1][2])+Sumb[i][j]; +             } A         } theprintf"%d\n", Max (dp[i-1][j-1][1],dp[i-1][j-1][2])); +     } -     return 0; $}

View Code

UVA 13,669 Martian Mining