Pagini recente » Cod sursa (job #499351) | Cod sursa (job #2675187) | Cod sursa (job #1661161) | Cod sursa (job #2346571) | Cod sursa (job #3188825)
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
int n, m, x, sol, i, j, k, p, sum;
int a[310][310], s[310][310], v[310];
int main(){
fin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s[i][j]=s[i-1][j]+a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
for(k=1;k<=m;k++)
v[k]=s[j][k]-s[i-1][k];
sum=0;
p=1;
for(k=1;k<=m;k++){
sum+=v[k];
while(sum>x)
sum-=v[p++];
sol=max(sol,(k-p+1)*(j-i+1));
}
}
fout<<sol<<"\n";
}
/*
3 5 1
0 0 0 0 1
0 1 0 0 0
0 0 0 1 0
0 0 0 0 1
0 1 0 0 1
0 1 0 1 2
*/