Pagini recente » Cod sursa (job #1497082) | Cod sursa (job #2039276) | Cod sursa (job #2675913) | Cod sursa (job #2811959) | Cod sursa (job #2971518)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
const int MAX_LENGTH = 6000;
int n, v[MAX_LENGTH + 1], sp[MAX_LENGTH + 1];
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
sp[0] = 0;
sp[1] = v[1];
long long maxim = -1000000000000, minim = 1000000000000;
for (int i = 2; i <= n; ++i) {
sp[i] = sp[i - 1] + v[i];
}
int i1 = 0, i2 = 0;
for (int i = 1; i <= n; ++i) {
if (sp[i] < minim) {
minim = sp[i];
i1 = i;
}
if (sp[i] > maxim) {
maxim = sp[i];
i2 = i;
}
}
cout << maxim - minim << " " << i1 << " " << i2;
return 0;
}