This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
int n,m,gs[310][310];
int koi(int a,int b)
{
int x=0,y=0;
if(a==n){ for(int i=b; i<=m; i++) x+=gs[a][i]; return x; }
if(b==m){ for(int i=a; i<=n; i++) x+=gs[i][b]; return x; }
for(int i=a; i<=n; i++)
for(int j=b; j<=m; j++) y+=gs[i][j];
for(int i=a; i<n; i++)
for(int j=b; j<m; j++)
{
x=0;
for(int p=a; p<=i; p++)
for(int q=b; q<=j; q++) x+=gs[p][q];
x+=koi(i+1,j+1);
if(y<x) y=x;
}
return y;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++) scanf("%d",&gs[i][j]);
printf("%d",koi(1,1));
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |