Pagini recente » Cod sursa (job #3279950) | Cod sursa (job #3277840) | Cod sursa (job #3278317) | Cod sursa (job #261536)
Cod sursa(job #261536)
#include <cstdio>
#define N 6000001
int A[N],n,i,j,best,maxim;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d\n",&n);
for (i=1; i<=n; i++) scanf("%d",&A[i]);
maxim=best=A[n];
int li=n,ls=n,limax,lsmax;
for (i=n-1; i; i--)
{
if (A[i]<best+A[i])
{
best+=A[i];
li--;
}
else
{
best=A[i];
li=ls=i;
}
if (best>maxim)
{
limax=li; lsmax=ls;
maxim=best;
}
}
printf("%d %d %d",maxim,limax,lsmax);
return 0;
}