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