Cod sursa(job #2190840)
| Utilizator | Data | 31 martie 2018 20:36:12 | |
|---|---|---|---|
| Problema | Teren | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin ("teren.in");
ofstream fout ("teren.out");
int m,n,x,i,j,y,nr,a,maxi,v[310][310];
int main (){
fin>>n>>m>>x;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>v[i][j];
i=1;
while(i<=n){
for(y=i;y<=n;y++)
for(j=1;j<=m;j++){
if(v[y][j]==1)
nr++;
if(nr<=x){
a=(y-i+1)*j;
if(a>maxi)
maxi=a;
}
else{
nr--;
break;
}
}
i++;
nr=0;
}
fout<<maxi;
return 0;
}
