Pagini recente » Cod sursa (job #1208918) | Cod sursa (job #2360794) | Cod sursa (job #1011761) | Cod sursa (job #2346298) | Cod sursa (job #2354188)
#include<fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int n,m,x,maxim;
int a[301][301];
int main(){
fin>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
fin>>a[i][j];
for(int j=1;j<=m;j++)
for(int i=1;i<=n;i++)
a[i][j]+=a[i-1][j];
for(int i1=1;i1<=n;i1++){
for(int i2=i1;i2<=n;i2++){
int s=0;
int p=1;
for(int j=1;j<=m;j++){
s+=(a[i2][j]-a[i1-1][j]);
while(s>x){
s-=(a[i2][p]-a[i1-1][p]);
p++;
}
if(maxim<(i2-i1+1)*(j-p+1))
maxim=(i2-i1+1)*(j-p+1);
}
}
}
fout<<maxim;
return 0;
}