Cod sursa(job #2105166)
Utilizator | Data | 12 ianuarie 2018 19:09:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i, n, x, bestSum = INT_MIN, sum = 0, index, pos_initial = 1, pos_final = 1;
int main()
{
f >> n;
for (i = 1; i <= n; i++) {
f >> x;
if (sum < 0) sum = x, index = i;
else sum += x;
if (bestSum < sum)
bestSum = sum, pos_initial = index, pos_final = i;
}
g << bestSum << ' ' << pos_initial << ' ' << pos_final;
return 0;
}