Cod sursa(job #1833861)
Utilizator | Data | 23 decembrie 2016 13:16:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <cstdio>
using namespace std;
int main() {
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i,st,dr,j,suma,max = 0,val;
scanf("%d",&n);
j = 1;
suma = 0;
for (i=1; i<=n; i++) {
scanf("%d",&val);
suma += val;
if (suma < val)
suma = val,j = i;
if (suma > max)
max = suma,st = j,dr = i;
}
printf("%d %d %d",max,st,dr);
return 0;
}