Pagini recente » Cod sursa (job #1867506) | Cod sursa (job #1078897) | Cod sursa (job #2290215) | Cod sursa (job #1288024) | Cod sursa (job #3277103)
#include<fstream>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
int N , M , X , Sp[301][301];
int main()
{
fin>>N>>M>>X;
for(int i=1 ; i<=N ; i++)
for(int j=1 ; j<=M ; j++){
int Nr;
fin>>Nr;
Sp[i][j]=Sp[i-1][j] + Nr;
}
int AMaxx=0;
for(int i1=1 ; i1<=N ; i1++)
for(int i2=i1 ; i2<=N ; i2++){
int Sum=0 , st=1;
for(int j=1 ; j<=M ; j++){
Sum+=Sp[i2][j]-Sp[i1-1][j];
while(Sum > X){
Sum-=Sp[i2][st] - Sp[i1-1][st];
st++;
}
if((i2-i1+1)*(j-st+1) > AMaxx)
AMaxx=(i2-i1+1)*(j-st+1);
}
}
fout<<AMaxx<<'\n';
return 0;
}