Cod sursa(job #2709600)
| Utilizator | Data | 20 februarie 2021 15:37:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int n;
fin >> n;
int maxSum = -int(2e9), x, beg, end, sum = 0;
for(int i = 1; i <= n; ++i) {
int el;
fin >> el;
if(sum < 0) {
sum = el;
x = i;
} else {
sum += el;
}
if(maxSum < sum) {
maxSum = sum;
beg = x;
end = i;
}
}
fout << maxSum <<" "<< beg <<" "<< end;
return 0;
}