Pagini recente » Cod sursa (job #2572720) | Cod sursa (job #2863479) | Cod sursa (job #1620173) | Cod sursa (job #2235632) | Cod sursa (job #1925806)
#include <fstream>
using namespace std;
int s[6000001], minim, maxim = -(2e9), jmin, inc, sf, n;
int main () {
ifstream fi("ssm.in");
ofstream fo("ssm.out");
fi >> n;
for (int i = 1; i <= n; i++)
fi >> s[i];
for (int i = 1; i <= n; i++) {
s[i] += s[i-1];
if (maxim < s[i]-minim)
maxim = s[i]-minim, inc = jmin+1, sf = i;
if (s[i] < minim)
minim = s[i], jmin = i;
}
fo << maxim << ' ' << inc << ' ' << sf;
return 0;
}