Cod sursa(job #825270)
Utilizator | Data | 28 noiembrie 2012 08:31:17 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#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);
}