Pagini recente » Cod sursa (job #2827596) | Cod sursa (job #1763888) | Cod sursa (job #118622) | Cod sursa (job #2493568) | Cod sursa (job #825271)
Cod sursa(job #825271)
#include<cstdio>
#define maxn 6000005
using namespace std;
int st_f,st,dr,bestsum,n,i,a[maxn],best[maxn];
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);
}