Pagini recente » Cod sursa (job #2382022) | Cod sursa (job #2615974) | Cod sursa (job #2612995) | Cod sursa (job #2109094) | Cod sursa (job #1183444)
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
ios::sync_with_stdio(false);
int n;
cin >> n;
int beststart = 0, bestend = 0, best = 1<<31;
int start = 0, sum = 0;
for (int i = 1; i <= n; i++) {
int e;
cin >> e;
sum += e;
if (best < sum) {
best = sum;
beststart = start;
bestend = i;
}
if (sum < 0) {
sum = 0;
start = i+1;
}
}
printf("%d %d %d\n", best, beststart, bestend);
return 0;
}