Cod sursa(job #2831819)
| Utilizator | Data | 12 ianuarie 2022 10:56:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n, i, smax=-2000000001, s=0, inceput=1, sfarsit, nr, inceput2;
fin >> n;
for ( i=1; i<=n; i++)
{
fin >> nr;
if (s<0)
{
s = 0;
inceput = i;
}
s += nr;
if (s > smax)
{ inceput2 = inceput;
smax = s;
sfarsit = i;
}
}
///cout << n;
fout << smax << " " <<inceput2<<" "<< sfarsit;
return 0;
}
