Cod sursa(job #2455223)
Utilizator | Fetean Flavius FlaviusFetean | Data | 10 septembrie 2019 23:20:33 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int jmin, Min, smax, imax, i, n, sp = 0, x, j;
j = jmin = 0, imax = 1;
fin >> n; fin >> sp;
Min = min(sp, 0);
smax = sp;
for(i = 2; i <= n; i++){
fin >> x; sp += x;
if(sp - Min > smax) smax = sp - Min, imax = i, jmin = j;
if(sp < Min) Min = sp, j = i;
}
fout << smax << " " << jmin + 1 << " " << imax;
return 0;
}