Pagini recente » Cod sursa (job #2751373) | Cod sursa (job #622767) | Cod sursa (job #2832904) | Cod sursa (job #954770) | Cod sursa (job #1240183)
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 7000005;
int v[maxn],n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
int smax=v[1],s=0,st,fin,x;
for(i=1;i<=n;i++)
{
if (s<0)
s=v[i],x= i;
else
s+=v[i];
if (smax<s)
smax=s,st=x,fin=i;
}
printf("%d %d %d\n",smax,st,fin);
return 0;
}