Cod sursa(job #2478039)
| Utilizator | Data | 21 octombrie 2019 16:13:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int main()
{
int n,i,x,M,s, st, dr, p;
/// st si dr retin capetele secventei maxime
/// p = poz de inceput a sumei
fin >> n;
fin >> x;
M = s = x;
st = dr = p = 1;
if (s < 0)
{
s = 0;
p = 2;
}
for (i=2; i<=n; i++)
{
fin >> x;
s+=x;
if (M < s) { M = s; dr = i; st = p;}
if (s < 0) { s = 0; p = i + 1;}
}
fout << M << " " << st << " " << dr;
return 0;
}
