Cod sursa(job #2360794)
Utilizator | Data | 2 martie 2019 10:14:17 | |
---|---|---|---|
Problema | Teren | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("teren.in");
ofstream g("teren.out");
int a[301][301],i,j,n,m,k,maxi;
int main()
{
f>>n>>m>>k;
for(i=1;i<=n;i++)for(j=1;j<=m;j++)f>>a[i][j];
for(i=1;i<=n;i++)for(j=1;j<=m;j++)a[i][j]=a[i][j]+a[i][j-1]+a[i-1][j]-a[i-1][j-1];
for(i=1;i<=n;i++)for(j=1;j<=m;j++)if(a[i][j]<=k&&i*j>maxi)maxi=i*j;
g<<maxi;
return 0;
}