Cod sursa(job #1650451)
Utilizator | Data | 11 martie 2016 18:25:28 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, x, i, sum, ls, ld, bestSum, bestLS, bestLD;
int main() {
fin>>n;
fin>>bestSum;
sum = bestSum;
bestLS = 1; bestLD = 1;
ls = 1; ld = 1;
for (i = 2 ; i <= n ; i++) {
fin>>x;
sum += x;
if (sum <= 0) {
sum = 0;
ls = i + 1;
}
if (sum > bestSum) {
bestSum = sum;
bestLS = ls;
bestLD = i;
}
}
fout<<bestSum<<' '<<bestLS<<' '<<bestLD;
}