Pagini recente » Cod sursa (job #1500534) | Cod sursa (job #3127007) | Cod sursa (job #233261) | Cod sursa (job #2005354) | Cod sursa (job #1723699)
#include<iostream>
#include<fstream>
using namespace std;
int i,j,n,m,sol,a[304][304],unu[304][304],p,k,x,sum;
int main()
{
ifstream cin("teren.in");
ofstream cout("teren.out");
cin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cin>>a[i][j];
if(a[i][j]==1)
unu[i][j]=unu[i][j-1]+1;
else unu[i][j]=unu[i-1][j];
}
for(i=0;i<n;i++)
for(j=i+1;j<=n;j++)
{
sum=0;p=1;
for(k=1;k<=m;k++)
{
while(sum<=x&&p<=m)
{
sum+=unu[j][p]-unu[i][p];
p++;
}
sum-=(unu[j][k]-unu[i][k]);
if(sum<=x)
sol=max(sol,(j-i)*(p-k));
}
}
cout<<sol;
return 0;
}