Cod sursa(job #1171395)
Utilizator | Data | 15 aprilie 2014 17:38:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int s, p, pp, u, maxx, n, i, x;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
pp=1;
maxx=-9999999;
for(i=1;i<=n;i++)
{
scanf("%d", &x);
s+=x;
if(s>maxx)
{
maxx=s;
u=i;
p=pp;
}
else if(s<0)
{
s=0;
pp=i+1;
}
}
printf("%d %d %d", maxx, p, u);
return 0;
}