Pagini recente » Cod sursa (job #911254) | Cod sursa (job #1959652) | Cod sursa (job #1482707) | Cod sursa (job #1149623) | Cod sursa (job #2577435)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
long long n,i,j,a[301][301],R,L,sum,max1,M,s[301],k,m;
int main()
{
f>>n>>m>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(L=1;L<=m;L++)
{
memset(s,0,sizeof(s));
for(R=L;R<=m;R++)
{
for(i=1;i<=n;i++)
s[i]=s[i]+a[i][R];
sum=0;
i=1;
while(i<=n)
{
sum=0;
j=i;
while(sum+s[i]<=k && i<=n)
{
sum=sum+s[i];
i++;
}
i--;
if((i-j+1)*(R-L+1)>max1)
max1=(i-j+1)*(R-L+1);
i++;
}
}
}
g<<max1;
return 0;
}