Cod sursa(job #2663916)
Utilizator | Data | 27 octombrie 2020 16:33:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int n, x, idx, st, dr;
int sum, best = -2000000000;
int main() {
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for (int i=1;i<=n;++i){
scanf("%d" , &x);
if (sum < 0){
sum = x;
idx = i;
}else{
sum += x;
}
if (sum > best){
best = sum;
st = idx;
dr = i;
}
}
printf("%d %d %d\n", best, st, dr);
return 0;
}