Pagini recente » Cod sursa (job #2766094) | Cod sursa (job #326811) | Cod sursa (job #2585423) | Borderou de evaluare (job #124297) | Cod sursa (job #2806308)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000001];
int main() {
int best = 0, start_idx = 1, end_idx = 1, maxBest = INT_MIN;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
if (v[i] + best >= v[i]) {
best += v[i];
} else {
best = v[i];
if (v[start_idx] < v[i]) {
start_idx = end_idx = i;
}
}
if (best > maxBest) {
maxBest = best;
end_idx = i;
}
}
fout << maxBest << " " << start_idx << " " << end_idx;
return 0;
}