Pagini recente » Cod sursa (job #1874015) | Cod sursa (job #1341097) | Cod sursa (job #2769984) | Cod sursa (job #385719) | Cod sursa (job #1520940)
#include<cstdio>
using namespace std;
int n,v[6000000],j,d[6000000],maxim=-1,s,f,k;
int main()
{
d[0]=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
k=0;
if(i>=2){j=i;
while(v[j]==0)
{
k++;
j--;
}
}
if(d[i-1]>0) d[i]=d[i-1]+v[i];
else d[i]=v[i];
if(d[i]==v[i]) v[i]=i;
else {
v[i]=v[i-1];
}
if(d[i]>=maxim)
{
maxim=d[i];
f=i;
s=v[i]-k;
}
}
printf("%d %d %d\n",maxim,s,f);
}