Pagini recente » Cod sursa (job #2852505) | Cod sursa (job #1684113) | Cod sursa (job #1675128) | Cod sursa (job #1320136) | Cod sursa (job #3309196)
#include <fstream>
using namespace std;
ifstream cin("teren.in");
ofstream cout("teren.out");
int S[301][301],n,m,x;
int main()
{
cin>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;++j)
{
cin>>S[i][j];
S[i][j]+=S[i-1][j];
}
/*for(int i=1;i<=n;i++, cout<<endl)
for(int j=1;j<=n;j++)
cout<<S[i][j]<<" ";*/
int amax=0;
for(int l=1;l<=n;l++)
for(int i=l;i<=n;i++)
{
int s=0,st=1;
for(int j=1;j<=n;j++)
{
s=s+S[i][j]-S[l-1][j];
if(s<=x && amax<(i-l+1)*(j-st+1)) amax=(i-l+1)*(j-st+1);
else while(s>x) s=s-S[i][st++];
}
}
cout<<amax;
return 0;
}