Pagini recente » Cod sursa (job #527166) | Cod sursa (job #2657176) | Cod sursa (job #2644941) | Cod sursa (job #2633181) | Cod sursa (job #2324644)
#include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,i,j,x,p,t,a[301][301],k,sc,amax;
int main()
{
fin>>n>>m>>k;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
fin>>x;
a[i][j]=a[i-1][j]+x;
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
sc=0;
p=1;
for(t=1;t<=m;t++){
sc+=a[j][t]-a[i-1][t];
for(;sc>k&& p<=t;sc-=a[j][p]-a[i-1][p],p++);
amax=max(amax,(t-p+1)*(j-i+1));
}
}
fout<<amax;
return 0;
}