Cod sursa(job #2354225)
| Utilizator | Data | 25 februarie 2019 00:58:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
using namespace std;
int a[(int) 6e6 + 5];
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
int sum = 0, mx = 0, f = 1, l = 0;
for(int i = 1; i <= n; i++) {
sum += a[i];
if(sum < 0)
f = i + 1, sum = 0;
else if(sum > mx) mx = sum, l = i;
}
printf("%d %d %d", mx, f, l);
return 0;
}
