Pagini recente » Cod sursa (job #2192949) | Cod sursa (job #1777888) | Cod sursa (job #3243008) | Cod sursa (job #821285) | Cod sursa (job #2926541)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int DIM = 6000001;
int n, x, top = 0;
int s[DIM], st[DIM];
int main() {
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> x;
s[i] = s[i - 1] + x;
}
int sumMax = INT_MIN, posI = 0, posJ = 0;
for (int i = n; i >= 1; i--) {
while (top > 0 && s[i] >= s[st[top]])
top--;
st[++top] = i;
int crtSum = s[st[1]] - s[i - 1];
if (crtSum > sumMax) {
sumMax = crtSum;
posI = i, posJ = st[1];
}
}
fout << sumMax << ' ' << posI << ' ' << posJ;
return 0;
}