Pagini recente » Cod sursa (job #532993) | Cod sursa (job #1604515) | Cod sursa (job #66168) | Cod sursa (job #1441166) | Cod sursa (job #2924484)
#include <fstream>
using namespace std;
ifstream cin("teren.in");
ofstream cout("teren.out");
int n,m,x,i,j,v[305][305],a[305][305],l,r,q,mx,mxx,s,w;
int main()
{
cin>>n>>m>>x;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
{
cin>>v[i][j];
a[j][i]=a[j][i-1]+v[i][j];
}
for(i=1;i<n;++i)
for(j=i+1;j<=n;++j)
{
l=1; mx=0; s=0;
for(q=1;q<=n;++q)
{
s+=(a[q][j]-a[q][i-1]);
if(s>x) ++l;
else mx=max(mx,q-l+1);
}
mxx=max(mxx,mx*(j-i+1));
}
cout<<mxx;
return 0;
}