Cod sursa(job #2279463)
| Utilizator | Data | 9 noiembrie 2018 16:40:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
using namespace std;
int x[6000005];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,s,smax,ic,im,sfm;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
s=smax=x[1];
ic=im=sfm=1;
for(i=2;i<=n;i++)
{
if(s+x[i]<x[i])
{
s=x[i];
ic=i;
}
else
s=s+x[i];
if(s>smax)
{
smax=s;
im=ic;
sfm=i;
}
}
printf("%d %d %d",smax,im,sfm);
return 0;
}
