Pagini recente » Cod sursa (job #94981) | Cod sursa (job #427689) | Cod sursa (job #1616282) | Cod sursa (job #1905960) | Cod sursa (job #2854462)
#include <fstream>
using namespace std;
ifstream cin ("teren.in");
ofstream cout ("teren.out");
int n, x, a[303][303], i, j, ok = true, m , i1,i2,st,dr,sum, s[1003][1003], maxx;
int main()
{
cin >> n >> m >> x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cin >> a[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s[i][j] = a[i][j] + s[i-1][j];
for(i1=1;i1<=n;i1++)
for(i2=i1;i2<=m;i2++)
{
sum=0;
st=1;
for(dr=1; dr<=n; dr++)
{
sum += s[i2][dr] - s[i2-i1][dr];
while(sum > x)
{
sum-=s[i2][st] - s[i1-1][st];
st++;
}
if(i1*(dr-st+1)>maxx)
maxx=i1*(dr-st+1);
}
}
cout << maxx;
return 0;
}