Cod sursa(job #1783439)
| Utilizator | Data | 18 octombrie 2016 23:51:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <cstdio>
using namespace std;
int n,incep,sfas,scad,adun,k,i;
int main()
{
freopen("ssm.in" , "r",stdin);
freopen("ssm.out" , "w",stdout);
int a[7000060],b[7000060];
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
b[1]=1;
if(i>1)
{
b[i]=b[i-1]+a[i];
}
}
scad=0;
adun=b[1];
k=0;
for(i=1;i<=n;i++)
{
if(b[i]-scad>adun)
{
adun=b[i]-scad;
incep=k;
sfas=i;}
if(b[i]<scad)
{
scad=b[i];
k=i;
}
}
incep=incep+1;
printf("%d %d %d",&adun,&incep,&sfas);
return 0;
}
