Cod sursa(job #2854233)
| Utilizator | Data | 21 februarie 2022 08:40:19 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main(void) {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, S;
int bestSum = INT_MIN, sum = 0, beg, endx, idx;
fin >> n;
for(int i=1;i<=n;i++) {
fin >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, beg = idx, endx = i;
}
fout << bestSum << " " << beg << " " << endx;
fin.close();
fout.close();
return 0;
}
