Pagini recente » Borderou de evaluare (job #112075) | Cod sursa (job #2494307)
#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;
}