Cod sursa(job #1935424)
| Utilizator | Data | 22 martie 2017 12:42:11 | |
|---|---|---|---|
| Problema | Teren | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int a[301][301],s[301][301];
int main()
{ int n,m,i,j,k,ii,jj,aria=0,sum;
ifstream f("teren.in");
ofstream g("teren.out");
f>>n>>m>>k;
for (i=1;i<=n;++i)
for (j=1;j<=m;++j) {
f>>a[i][j];
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
}
for (i=1;i<=n;++i)
for (j=1;j<=m;++j) {
ii=i;jj=j;
for (ii=i;ii<=n;++ii)
for (jj=j;jj<=m;++jj) {
sum=s[ii][jj]-s[i-1][jj]-s[ii][j-1]+s[i-1][j-1];
if (sum<=k) aria=max(aria,(ii-i+1)*(jj-j+1));
}
}
g<<aria<<"\n";
return 0;
}
