Pagini recente » Cod sursa (job #2639618) | Cod sursa (job #2082029) | Cod sursa (job #561587) | Cod sursa (job #956956) | Cod sursa (job #3137809)
#include <fstream>
using namespace std;
ifstream in("teren.in");
ofstream out("teren.out");
bool a[301][301];
int sp[301][301];
int main()
{
int n, m, x;
in>>n>>m>>x;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
in>>a[i][j];
sp[i][j]=sp[i][j-1]+sp[i-1][j]-sp[i-1][j-1];
}
}
int ariemax=0, arie, stricate, bune;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
for(int k=i; k<=n; k++)
{
for(int l=j; l<=m; l++)
{
stricate=sp[k][l]-sp[i-1][l]-sp[k][j-1]+sp[i-1][j-1];
if(stricate<=x)
{
arie=(k-i+1)*(l-j+1);
if (arie>ariemax)
{
ariemax=arie;
}
}
}
}
}
}
out<<ariemax;
}