Pagini recente » Cod sursa (job #1814314) | Istoria paginii runda/croitorasul_cel_viteaz/clasament | Cod sursa (job #430079) | Cod sursa (job #2465098) | Cod sursa (job #1640239)
#include <cstdio>
using namespace std;
int a[6000001],n,i,s,smax,u,p,pr,ul;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for (i=0;i<n;i++) scanf("%d",&a[i]);
s=smax=a[0];p=u=0;
for (i=1;i<n;++i)
{
if (s>0) s+=a[i];
else {
s=a[i];
pr=i;
}
if (smax<s) {
smax=s;
p=pr;
u=i;
}
else
if (s==smax && u-p>i-pr) {
u=i;
p=pr;
}
}
printf("%d %d %d",smax,p+1,u+1);
}