Cod sursa(job #561934)
Utilizator | Horia Cretescu ELHoria | Data | 21 martie 2011 23:11:17 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++ i)
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAXN = 7000005;
int main() {
int n, S;
int bestSum = -int(2e9), sum = 0, beg, end, idx;
f >> n;
FOR (i, 1, n) {
f >> S;
if (sum < 0)
sum = S, idx = i;
else
sum += S;
if (bestSum < sum)
bestSum = sum, beg = idx, end = i;
}
g << bestSum << " " << beg << " " << end;
return 0;
}