Cod sursa(job #1083799)
Utilizator | Data | 16 ianuarie 2014 13:52:27 | |
---|---|---|---|
Problema | Teren | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.97 kb |
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n, m, x, a, nru[301][301], i, j, k, t, s, st, dr, jo, su, l, amax=0, tmp, inc;
int main()
{
f>>n>>m>>x;
for(i=1; i<=n; i++)
{
for(j=1; j<=m; j++)
{
f>>a;
nru[i][j]=nru[i-1][j]+a;
}
}
for(i=1; i<=n; i++)
{
for(j=i; j<=n; j++)
{
s=0;
st=1;
for(k=1; k<=m; k++)
{
t=nru[j][k]-nru[i-1][k];
while(st<k&&s+t>x){
s=s-nru[j][st]+nru[i-1][st];
st++;
}
if(t+s<=x)
s+=t;
if (amax < (k-st+1)*(j-i+1))
amax=(k-st+1)*(j-i+1);
}
if (amax < (k-st+1)*(j-i+1))
amax=(k-st+1)*(j-i+1);
}
}
g<<amax;
return 0;
}