Pagini recente » Cod sursa (job #2492612) | Cod sursa (job #2100688) | Cod sursa (job #2558831) | Cod sursa (job #1822664) | Cod sursa (job #2672346)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("teren.in");
ofstream out ("teren.out");
int n,m,c;
int v[305][305];
int main()
{
in>>n>>m>>c;
for(int i = 1; i <= n; i++)
for(int j = 1; j <=m ; j++)
{
in>>v[i][j];
v[i][j]+=v[i-1][j];
}
int maxx=-1;
for(int i = 1; i <= n; i++)
for(int j = i; j <= n; j++)
{
int k=1, sum=0;
for(int f = 1; f <= m; f++)
{
sum+=v[j][f]-v[i-1][f];
while(sum > c)
{
sum-=v[j][k]-v[i-1][k];
k++;
}
if(maxx < (f-k+1)*(j-i+1))
maxx=(f-k+1)*(j-i+1);
}
}
out<<maxx;
return 0;
}