Cod sursa(job #2952157)
Utilizator | Data | 8 decembrie 2022 17:41:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
using namespace std;
int nr,x,y,smax,i,j,m,n,a[255][255];
int main()
{
cin>>n>>m;
for(i=1;i<=n;i++)
for (j=1;j<=m;j++)
cin>>a[i][j];
nr=0;
smax=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]==1)
if(a[i-1][j]==0 && a[i][j-1]==0)
{
nr++;
x=i;
y=j;
while (a[i][y]==1) y++;
while (a[x][j]==1) x++;
if(smax<(x-1)*(y-j))
smax=(x-i)*(y-j);
}
cout << nr << " " << smax;
return 0;
}