Pagini recente » Cod sursa (job #2892654) | Cod sursa (job #2538416) | Cod sursa (job #166967) | Cod sursa (job #2643024) | Cod sursa (job #2071861)
#include <fstream>
using namespace std;
int n,m,x,i,j,a[302][302],b[302][302],maxi;
ifstream f("teren.in");
ofstream g("teren.out");
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++){
b[i][j]=b[i][j-1]+b[i-1][j]-b[i-1][j-1];
if(a[i][j]==1)
b[i][j]++;
a[i][j]=i*j;
}
maxi=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(maxi<a[i][j]&&x>=b[i][j])
maxi=a[i][j];
g<<maxi;
return 0;
}