Mai intai trebuie sa te autentifici.
Cod sursa(job #111562)
| Utilizator | Data | 30 noiembrie 2007 17:08:52 | |
|---|---|---|---|
| Problema | Teren | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.78 kb |
#include<fstream.h>
ifstream f("teren.in");
ofstream g("teren.out");
int a[110][110],secv[110],n,m,i,j,k,s,ik,mk,maxx,ok;
int main()
{
f>>n>>m>>ok;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++) f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++) a[i][j]=a[i-1][j]+a[i][j];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
for(k=1;k<=m;k++) secv[k]=a[j][k]-a[i-1][k];
s=0;
mk=0;
ik=1;
for(k=1;k<=m;k++)
{
s=s+secv[k];
while (s>ok)
s=s-secv[ik++];
if(k-ik+1>mk) mk=k-ik+1;
}
if(maxx<(j-i+1)*mk) maxx=(j-i+1)*mk;
}
g<<maxx;
return 0;
}
