Pagini recente » Cod sursa (job #1932936) | Cod sursa (job #1733394) | Cod sursa (job #1327197) | Cod sursa (job #2572651) | Cod sursa (job #862972)
Cod sursa(job #862972)
#include<cstdio>
#define maxn 6000050
using namespace std;
int a[maxn],best[maxn],n,st,dr,i,st_f,bestsum;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d%d",&n,&a[1]);
bestsum=a[1];
for(i=1;i<=n;++i)
{
if(i!=1)
scanf("%d",&a[i]);
best[i]=a[i];
if(best[i]<=best[i-1]+a[i])
best[i]=best[i-1]+a[i];
else
st=i;
if(bestsum<best[i])
bestsum=best[i],dr=i,st_f=st;
}
printf("%d %d %d\n",bestsum,st_f,dr);
}