Cod sursa(job #2285997)
Utilizator | Data | 19 noiembrie 2018 17:54:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
const int MAXN = 7000005;
#define Max(a, b) ((a) > (b) ? (a) : (b))
int main(void) {
ifstream f("ssm.in");
int n, S;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
f >> n;
for (int i=1;i<=n;i++) {
f >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
ofstream g("ssm.out");
g << bestSum << " " << beg << " " << end;
return 0;
}