Cod sursa(job #1769816)
| Utilizator | Data | 3 octombrie 2016 11:00:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
using namespace std;
int v[6000005];
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
long long sc,smax=1LL<<33,n,i,imax,x,inc,incmax;
scanf("%d",&n);
smax=(-1)*smax;
sc=0;
inc=1;
for(i=1; i<=n; ++i)
{
scanf("%d",&v[i]);
x=v[i];
if(x<sc+x)
sc+=x;
else
{
sc=x;
inc=i;
}
if(sc>smax)
{
smax=sc;
imax=i;
incmax=inc;
}
}
printf("%d %d %d\n",smax,incmax,imax);
return 0;
}
