Pagini recente » Cod sursa (job #2557293) | Cod sursa (job #2953557) | Cod sursa (job #44455) | Cod sursa (job #411152) | Cod sursa (job #499727)
Cod sursa(job #499727)
#include<cstdio>
#include<fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int s[100][100],a[100][100];
int main()
{
int n,i,j,nrp=0,p,m,x,nr=0,j1,max,j2;
in>>n>>m>>x;
max=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
in>>a[i][j];
s[i][j]=s[i][j-1]+a[i][j];
}
for(j1=1;j1<m;j1++)
for(j2=j1;j2<=m;j2++)
{
nr=0;
nrp=0;
for(i=1;i<=n;i++)
{
if (nr>x)
{
nr=0;
//nrp=(j1-j2)*((i-1)-p);
if (nrp>max) max=nrp;
nrp=0;
//p=i;
}
nr=nr+s[i][j2]-s[i][j1-1];
nrp=nrp+(j2-j1+1);
//if (nrp>max) max=nrp;
}
}
out<<max;
return 0;
}