Pagini recente » Cod sursa (job #1059832) | Cod sursa (job #1524673) | Cod sursa (job #1171303) | Cod sursa (job #2684006) | Cod sursa (job #1623904)
#include <iostream>
#include<fstream>
#include<deque>
using namespace std;
int i,j,n,m,i1,s[305][305],sum,var,k,mx,a,start;
int main()
{
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>k;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>a;
s[i][j]=s[i-1][j]+a;
}
for(i1=0;i1<=i-1;i1++)
{
sum=0;start=1;
for(j=1;j<=m;j++)
{
var=s[i][j]-s[i1][j];
sum+=var;
if(sum>k)
while(start<=j && sum>k)
{
sum-=s[i][start]-s[i1][start];
start++;
}
if((j-start+1)*(i-i1)>mx) mx=(j-start+1)*(i-i1);
}
}
}
g<<mx;
return 0;
}