Mai intai trebuie sa te autentifici.
Cod sursa(job #1245751)
Utilizator | Data | 19 octombrie 2014 21:53:53 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.82 kb |
#include <cstdio>
int n, sum, best, idx, inc, sfx;
//int v[6000100];
/*void citire()
{
int i;
scanf("%d\n", &n);
for(i=1;i<=n;++i)
scanf("%d", &v[i]);
}*/
void secsm()
{
int x;
scanf("%d", &n);
int i;
sum=0;
best=0;
for(i=1;i<=n;++i)
{
scanf("%d", &x);
if(sum<0)
{
sum=x;
inc=i;
}
else
sum+=x;
if(sum>best)
{
best=sum;
idx=inc;
sfx=i;
}
}
}
void afisare()
{
printf("%d %d %d", best, idx, sfx);
}
void rezolva_problema()
{
// citire();
secsm();
afisare();
}
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
rezolva_problema();
return 0;
}