Cod sursa(job #1539989)
| Utilizator | Data | 1 decembrie 2015 21:32:00 | |
|---|---|---|---|
| Problema | Teren | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
bool teren[301][301];int stricat[301];
int main()
{int i,j,n,m,x,st=1,dr,s=0,A=0;
f>>n>>m>>x;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>teren[i][j];
if(teren[i][j]==1)
{
stricat[j]++;
}
}
}
for(dr=1;dr<=m;dr++)
{
s=s+stricat[dr];
while(st<=dr&&s>x)
{
s=s-stricat[dr];
st=st+1;
}
if(st<=dr)
{
A=max(A,(j-i+1)*(dr-st+1));
}
}
g<<A;
f.close();
g.close();
return 0;
}
