Pagini recente » Cod sursa (job #2331690) | Monitorul de evaluare | Cod sursa (job #202883) | Cod sursa (job #476691) | Cod sursa (job #1964592)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,a[303][303],k,v[303],i1,s,mx;
int main()
{
f>>n>>m>>k;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
f>>a[i][j];
a[i][j]+=a[i-1][j];
}
}
for(int z=0;z<n;++z)
{
for(int i=z+1;i<=n;++i)
{
i1=1;
s=0;
for(int j=1;j<=m;++j)
{
s+=a[i][j]-a[z][j];
while(s>k)
{
s-=(a[i][i1]-a[z][i1]);
++i1;
}
mx=max(mx,(i-z)*(j-i1+1));
}
}
}
g<<mx;
return 0;
}