Cod sursa(job #838059)
| Utilizator | Data | 18 decembrie 2012 22:26:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n, x;
scanf("%d", &n);
int sum = 0, msum = -(int)2e9;
int b, beg, end;
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
if (sum < 0) {
b = i;
sum = x;
}
else sum += x;
if (sum > msum) {
msum = sum;
end = i + 1;
beg = b + 1;
}
}
cout << msum << " " << beg << " " << end << "\n";
return 0;
}
