Cod sursa(job #2649939)
| Utilizator | Data | 16 septembrie 2020 21:14:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n;
int maxSum = -2000000000, iMin, iMax, indexleft = 1, initialSum = 0;
fin >> n;
for (int i = 1; i <= n; ++i) {
int x;
fin >> x;
if (initialSum >= 0) {
initialSum += x;
} else {
initialSum = x;
indexleft = i;
}
if (maxSum < initialSum) {
maxSum = initialSum;
iMin = indexleft;
iMax = i;
}
}
fout << maxSum << " " << iMin << " " << iMax;
return 0;
}
