Pagini recente » Borderou de evaluare (job #2432143) | Cod sursa (job #825270)
Cod sursa(job #825270)
#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",&n);
for(i=1;i<=n;++i)
scanf("%d",&a[i]);
bestsum=a[1];
for(i=1;i<=n;++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);
}