Pagini recente » Cod sursa (job #3175063) | Cod sursa (job #41268) | Cod sursa (job #2585749) | Cod sursa (job #2578963) | Cod sursa (job #1922557)
#include <iostream>
#include <stdio.h>
using namespace std;
long long best[1000001];
long long buffer[1000001];
int maxSUM = 0, minSUM = 1000000;
int mx, mi, begi;
int SUM;
int main () {
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int Load;
cin >> Load;
cin >> best[0];
for (int i = 1; i < Load; i++) {
cin >> buffer[i];
if (best [i - 1] > 0)
best[i] = best[i-1] + buffer[i];
else {
best[i] = buffer[i];
begi = i;
}
if (best[i] > maxSUM) {
maxSUM = best[i], mx = i; mi = begi;
}
}
cout << best[mx] << " " << begi + 1 << " " << mx + 1;
}