Pagini recente » Cod sursa (job #2819066) | Borderou de evaluare (job #996860) | Cod sursa (job #1658128) | Cod sursa (job #735956) | Cod sursa (job #2285998)
#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, en, 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, en = i;
}
ofstream g("ssm.out");
g << bestSum << " " << beg << " " << end;
return 0;
}