Pagini recente » Cod sursa (job #1037730) | Cod sursa (job #342260) | Cod sursa (job #2406752) | Cod sursa (job #2449060) | Cod sursa (job #2070063)
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int n,m,x,i,j,s[301][302],S,st,dr,Max;
int main()
{
f>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>s[i][j];
s[i][j]+=s[i-1][j];
}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
st=1;
dr=1;
S=s[j][1]-s[i-1][1];
while(dr<=m)
{
while(S<=x&&dr<=m)
{
dr++;
S+=s[j][dr]-s[i-1][dr];
}
if(S-(s[j][dr]-s[i-1][dr])<=x)
Max=max((j-i+1)*(dr-st),Max);
while(S>x&&st<dr)
{
S-=(s[j][st]-s[i-1][st]);
st++;
}
dr++;
}
}
g<<Max;
return 0;
}