Pagini recente » Cod sursa (job #1274646) | Cod sursa (job #1877685) | Cod sursa (job #923610) | Cod sursa (job #522916) | Cod sursa (job #1147354)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,a[101][101],sum,sol,st,dr,i,j,suma,s[101][101];
int main(){
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++)
s[i][j]=s[i-1][j]+a[i][j];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
st=1; sum=0;
for(dr=1;dr<=m;dr++){
sum+=s[j][dr]-s[i-1][dr];
suma=sum;
while(suma>x && st<=dr){
suma-=s[j][st];
st++;
}
if(st<=dr) sol=max(sol,(dr-st+1)*(j-i+1));
}
}
g<<sol;
}