Pagini recente » Cod sursa (job #596787) | Cod sursa (job #2316229) | Cod sursa (job #2533412) | Cod sursa (job #2281333) | Cod sursa (job #2968786)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("ssm.in");
ofstream fout("ssm.out");
#endif
#define endl '\n'
const int NMAX = 6e6+5;
int n;
int a[NMAX];
void read() {
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> a[i];
}
}
void solve() {
int64_t sp = 0, mn = a[1], ans = 0;
int l = 0, r = 0;
for (int i = 1; i <= n; i++) {
sp += a[i];
if (ans < sp - mn) {
ans = sp - mn;
r = i;
}
if (mn > sp) {
mn = sp;
l = i + 1;
}
}
fout << ans << ' ' << l << ' ' << r;
}
int main() {
read();
solve();
return 0;
}