Pagini recente » Cod sursa (job #2659796) | Cod sursa (job #3219811) | Cod sursa (job #2984813) | Cod sursa (job #2899999) | Cod sursa (job #2871327)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("teren.in");
ofstream fout("teren.out");
const int NMAX=305;
int a[NMAX][NMAX],sp[NMAX][NMAX];
int armax;
int main(){
int n,m,k;
int st=1,s=0,armax=0;
fin >> n >> m>>k;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
fin>>a[i][j];
sp[i][j]=sp[i-1][j]+a[i][j];
}
}
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
st=1,s=0;
for(int dr=1;dr<=m;dr++){
s+=sp[j][dr]-sp[i-1][dr];
while(st<=dr && s>k){
s-=sp[j][st]+sp[i-1][st];
st++;
}
armax=max(armax,(j-i+1)*(dr-st+1));
}
}
}
fout <<armax;
}