Pagini recente » Cod sursa (job #2343448) | Cod sursa (job #2307744) | Cod sursa (job #415529) | Cod sursa (job #2617100) | Cod sursa (job #1516675)
# include <fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int v[301][301],n,m,k,i,j,x,maxim,y;
int main () {
fin>>n>>m>>k;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
fin>>x;
v[i][j]=v[i-1][j]+v[i][j-1]-v[i-1][j-1]+x;
}
}
for(i=n;i>=1;i--){
for(j=m;j>=1;j--){
for(x=0;x<=i;x++){
for(y=0;y<=j;y++){
if((v[i][j]-v[i-x][j]-v[i][j-y]+v[i-x][j-y])<=k&&x*y>maxim)
maxim=x*y;
}
}
}
}
fout<<maxim;
return 0;
}