Cod sursa(job #1146534)
| Utilizator | Data | 19 martie 2014 08:38:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
long n, sum, S, best, auxi, beg, end;
f >> n;
best = -0x0f0f0f;
sum = auxi = beg = end = 0;
for(int i = 1; i <= n; ++i)
{
f >> S;
if(sum < 0)
sum = S, auxi = i;
else
sum += S;
if(best < sum)
best = sum, beg = auxi, end = i;
}
g << best << " " << beg << " " << end;
return 0;
}
