Pagini recente » Solutii ONIS 2014, Runda 4 | mirceadino | Cod sursa (job #217853) | Istoria paginii planificare/camp-neverending-story | Cod sursa (job #1333124)
#include <cstdio>
using namespace std;
int n,a[6000010],i,m,s,ic,sf,pc;
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]);
s=a[1]; m=a[1];
ic=1; pc=1;
sf=1;
for (i=2; i<=n; i++)
{
if (s + a[i]<=0)
{
pc=i; s=a[i];
}
else s=s+a[i];
if (s>m)
{
ic=pc;
sf=i;
m=s;
}
}
printf("%d %d %d\n",m,ic,sf);
return 0;
}