Cod sursa(job #885859)
| Utilizator | Data | 22 februarie 2013 14:02:52 | |
|---|---|---|---|
| Problema | Teren | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
int n,m,k,dr,i,x,j,st,b[301],nr,a[301][301];
int main () {
in>>n>>m>>x;
int max=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
in>>k;
a[i][j]=a[i-1][j]+k;}
for(i=1;i<=n;i++)
for(j=i;j<=n;j++){
nr=0;st=1;
for(dr=1;dr<=m;dr++){
b[dr]=a[j][dr]-a[i-1][dr];
nr+=b[dr];
while(nr>x&&st<dr){
nr=nr-b[st]; st++;}
if(nr<=x&&(j-i+1)*(dr-st+1)>max)
max=(j-i+1)*(dr-st+1);
}
}
out<<max;
return 0;
}
