Cod sursa(job #1229431)
Utilizator | Data | 17 septembrie 2014 10:12:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int n, x;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int i,sf,inc,binc,smax=-int(2e9),s=0;
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
scanf("%d",&x);
if (s<0)
{
s=0;
inc=i;
}
s=s+x;
if (s>smax)
{
smax=s;
binc=inc;
sf=i;
}
}
printf("%d %d %d",smax,binc,sf);
return 0;
}