Pagini recente » Cod sursa (job #667413) | Cod sursa (job #3258395) | Cod sursa (job #1764420) | Cod sursa (job #2540829) | Cod sursa (job #2398002)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
int n, m, x, v[301][301], d[301][301], suma, st, aria;
int main (){
fin>>n;
fin>>m;
fin>>x;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++){
fin>>v[i][j];
d[i][j]=d[i-1][j] + v[i][j];
}
for(int i=1; i<=n; i++){
for(int ii=i; ii<=n; ii++){
suma=0;
st=1;
for(int j=1; j<=m; j++){
suma=suma + d[ii][j] - d[ii-i][j];
while(suma > x){
suma=suma - (d[ii][st] - d[ii-i][st]);
st++;
}
if(i * (j-st+1) > aria)
aria=i * (j-st+1);
}
}
}
fout<<aria;
return 0;
}