Pagini recente » Cod sursa (job #1125983) | Profil topalavlaicu | Cod sursa (job #2071546) | Cod sursa (job #874927) | Cod sursa (job #2912861)
#include <iostream>
#include <fstream>
using namespace std;
int n, k, v[16005], max_sum, act_sum, leftt = 1, rightt;
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> v[i];
}
int cnt = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= i; ++j) {
for (k = j; k <= i; ++k) {
act_sum += v[k];
}
if (act_sum > max_sum) {
max_sum = act_sum;
leftt = j;
rightt = i;
}
act_sum = 0;
}
}
fout << max_sum << ' ' << leftt << ' ' << rightt;
return 0;
}