Cod sursa(job #1183443)
| Utilizator | Data | 9 mai 2014 09:37:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
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;
}
