Pagini recente » Cod sursa (job #2402761) | Cod sursa (job #758204) | Cod sursa (job #2110718) | Cod sursa (job #1909279) | Cod sursa (job #1593942)
#include <fstream>
using namespace std;
const int NMAX=305;
int n,m,x,s[NMAX][NMAX],a[NMAX],sol;
int main()
{
int val;
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
f>>val;
s[i][j]=s[i-1][j]+val;
}
for(int line=1;line<=n;line++)
{
for(int line1=line;line1<=n;line1++)
{
for(int i=1;i<=m;i++)
a[i]=s[line1][i]-s[line-1][i];
int i=1,sum=0;
for(int j=1;j<=m;j++)
{
sum+=a[j];
while(sum>x)
{
sum-=a[i];
i++;
}
sol=max(sol,(j-i+1)*(line1-line+1));
}
}
}
g<<sol<<"\n";
return 0;
}