Pagini recente » Cod sursa (job #352824) | Cod sursa (job #2900631) | Cod sursa (job #2632430) | Cod sursa (job #1088529) | Cod sursa (job #935792)
Cod sursa(job #935792)
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int v[305][305],b[315],nr,st,dr,i,j,M,N,x,maxim;
int main()
{
in>>N>>M>>x;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++){
in>>v[i][j];
v[i][j]+=v[i-1][j];
}
for(i=1;i<=N;i++)
{
for(j=i;j<=N;j++)
{
st=1;nr=0;
for(dr=1;dr<=M;dr++){
b[dr]=v[j][dr]-v[i-1][dr];
nr+=b[dr];
while(nr>x&&st<dr){
nr-=b[st];
st++;
}
if((j-i+1)*(dr-st+1)>maxim&&nr<=x)
maxim=(j-i+1)*(dr-st+1);
}
}
}
out<<maxim<<'\n';
in.close();
out.close();
return 0;
}