Pagini recente » Cod sursa (job #2720992) | Cod sursa (job #323868) | Cod sursa (job #2532646) | Cod sursa (job #1592259) | Cod sursa (job #2430568)
#include <iostream>
#include <fstream>
using namespace std;
int a[310][310],v[310];
int main()
{
int n,m,x,i,j,t,p,h,M=0;
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
a[i][j]+=a[i][j-1];
for(i=1;i<=m;i++)
for(j=i;j<=m;j++){
for(t=1;t<=n;t++)
v[t]=a[t][j]-a[t][i];
int s=0;
p=1;
for(h=1;h<=n;h++){
s+=v[h];
while(s>x && p<=h){
s+=-v[p];
p++;}
if((j-i+1)*(h-p+1)>M)
M=(j-i+1)*(h-p+1);}}
g<<M;
}