Pagini recente » Borderou de evaluare (job #1047105) | Borderou de evaluare (job #1776319) | Borderou de evaluare (job #2235444) | Borderou de evaluare (job #2235135) | Cod sursa (job #640681)
Cod sursa(job #640681)
#include <iostream>
#include <stdio.h>
using namespace std;
int a[6000005], ind[6000005], bst[6000005];
int main()
{
int i, imax, jmax, n, smax=0;
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
cin>>n;
for(i=1; i<=n; i++)
cin>>a[i];
for(i=1; i<=n; i++)
{
if(a[i]<bst[i-1]+a[i]) bst[i]=bst[i-1]+a[i], ind[i]=ind[i-1];
else bst[i]=a[i], ind[i]=i;
}
for(i = 1; i <= n; i++)
if(bst[i]>smax) {smax=bst[i]; imax=ind[i]; jmax=i;}
cout<<smax<<" "<<imax<<" "<<jmax;
return 0;
}