Pagini recente » Cod sursa (job #2038057) | Cod sursa (job #826397) | Cod sursa (job #1059760) | Cod sursa (job #1786907) | Cod sursa (job #2649904)
#include <iostream>
#include <fstream>
using namespace std;
int v[6000001];
long long s[6000001];
int answer[6000001];
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, minim = 6000000, maxim = -6000000, imax = 0, imin = 0;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
for (int i = 0; i <= n; ++i) {
s[i] = 0;
}
for (int i = 1; i <= n; ++i) {
s[i] = s[i - 1] + v[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < i; ++j) {
if (s[j] <= minim) {
minim = s[j];
imin = j + 1;
}
answer[i] = s[i] - minim;
if (answer[i] > maxim) {
maxim = answer[i];
imax = i;
}
}
}
cout << maxim << " " << imin << " " << imax;
return 0;
}