Pagini recente » Cod sursa (job #3236299) | Cod sursa (job #1332133) | Cod sursa (job #14968) | Cod sursa (job #160799) | Cod sursa (job #2557197)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int x,y,n,m,i,j,s[101][101],ii,jj,s1,Max,ar;
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>y;
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+y;
}
for(i=1;i<=n;i++)
{
for(j=i;j<=m;j++)
{
for(ii=1;ii<=n;ii++)
{
for(jj=ii;jj<=m;jj++)
{
ar=ii*jj;
s1=s[ii][jj]-s[i-1][jj];
if(s1<=0 && s1>=-x)
{
if(ar>Max)
Max=ar;
}
}
}
}
}
g<<Max-1;
}