Cod sursa(job #2561572)
| Utilizator | Data | 28 februarie 2020 22:20:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <cstdio>
using namespace std;
const int NMAX=6000005;
int v[NMAX];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,ic,im,sfm,s,smax;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
s=smax=v[1];
ic=im=1;
for(i=2;i<=n;i++)
{
if(s+v[i]>v[i])
s=s+v[i];
else
{
s=v[i];
ic=i;
}
if(s>smax)
{
smax=s;
im=ic;
sfm=i;
}
}
printf("%d %d %d",smax,im,sfm);
return 0;
}
