Cod sursa(job #2153271)
Utilizator | Data | 6 martie 2018 08:54:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int x, n, s, smax=0, is, j;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
is = 1;
j = 1;
for(int i=1; i<=n; i++)
{
scanf("%d", &x);
s+=x;
if(s > smax)
{
smax = s;
j=i;
}
if(s < 0)
{
s=0;
is = i+1;
j = i;
}
}
printf("%d %d %d", smax, is, j);
return 0;
}