Cod sursa(job #2493061)
Utilizator | Petre OMpirescu sunt_grozav | Data | 15 noiembrie 2019 21:24:55 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
#define maxim 6000001
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
short V[maxim];
int N;
int S, in, jn;
int main()
{
fin >> N;
for (int i = 1; i < N; i++) {
fin >> V[i];
if (i == 1) {
S = V[1];
continue;
}
//cout << S << ' ' << V[i] << endl;
if (V[i] + S > V[i]) {
jn ++;
S += V[i];
} else {
in = i;
jn = i;
S = V[i];
}
}
//cout << S << ' ' << in << ' ' << jn;
fout << S << ' ' << in << ' ' << jn;
return 0;
}