Pagini recente » Cod sursa (job #2944920) | Cod sursa (job #1249888) | Cod sursa (job #2244584) | Cod sursa (job #1055796) | Cod sursa (job #2973256)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
const int MAX_LENGTH = 6000000;
int n, v[MAX_LENGTH + 1], sp[MAX_LENGTH + 1];
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
sp[0] = 0;
sp[1] = v[1];
long long maxim = -5000000000, minim = 5000000000;
for (int i = 2; i <= n; ++i) {
sp[i] = sp[i - 1] + v[i];
}
// cout << "sirul sp[] = ";
/*
for (int i = 1; i <= n; ++i) {
cout << sp[i] << " ";
}
cout << "\n";
*/
int sum, i1 = 0, i2 = 0;
for (int i = 0; i <= n; ++i) {
if (sp[i] < minim) {
minim = sp[i];
i1 = i + 1;
}
}
for (int i = i1; i <= n; ++i) {
if (sp[i] > maxim) {
maxim = sp[i];
i2 = i;
}
}
fout << maxim - minim << " " << i1 << " " << i2;
return 0;
}