Pagini recente » Cod sursa (job #2210930) | Cod sursa (job #1417857) | Cod sursa (job #1315918) | Cod sursa (job #3237106) | Cod sursa (job #3309195)
#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];
}
int amax=0;
for(int i=1;i<=n;i++)
{
int s=0,st=1;
for(int j=1;j<=n;j++)
{
s=s+S[i][j];
if(s<=x && amax<=i*(j-st+1)) amax=i*(j-st+1);
else while(s>x) s=s-S[i][st++];
}
}
cout<<amax;
return 0;
}