You are on page 1of 2

#include <iostream>

using namespace std;

int main()
{
int v[1001], i, n, is=-1, ls=0, ism=-1, lsm=0, j;
cin>>n;

for(i=1; i<=n; i++)


cin>>v[i];

for(i=1; i<=n; i++)


{
if(v[i]==0)///incepe secv
{
is=i;
ls=1;
for(j=i+1; j<=n; j++)
{
if(v[j]==0)
{
ls++;
if(j == n){ ///am ajuns la finalul vectorului
i = n+1;
if(ls>lsm)
{
lsm=ls;
ism=is;
}
}
}
else /// se termina
{
if(ls>lsm)
{
lsm=ls;
ism=is;
}
i=j;
ls=0;
break;
}
}
}
}/*
i = n;
if(v[i]==0)
while (v[i]==v[i-1])
{
i--;
}
if(n-i+1>lsm)
{
lsm=n-i+1;
ism=i;
}*/
int isf = ism+lsm-1;
cout<<ism<<' '<<isf;
return 0;
}

You might also like