Pagini recente » Cod sursa (job #1595775) | Cod sursa (job #2106739) | Cod sursa (job #1861569) | Cod sursa (job #3208844) | Cod sursa (job #2801223)
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, v[6000001], sp[6000001];
int main() {
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
int max = v[1], left = 0, right = 0;
for (int i = 1; i < n; ++i) {
int sum = 0;
for (int j = i; j <= n; ++j) {
sum += v[j];
if (sum > max) {
max = sum;
left = i;
right = j;
}
}
}
fout << max << " " << left << " " << right;
return 0;
}
/*
int main() {
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
sp[i] = sp[i - 1] + v[i];
fout << sp[i] << " ";
}
return 0;
}
*/