Pagini recente » Cod sursa (job #2555264) | Cod sursa (job #2799256) | Cod sursa (job #530120) | Cod sursa (job #1848276) | Cod sursa (job #2906384)
#include <iostream>
using namespace std;
int n, z, v[1001], actS = 0, maxS = -1, pos = 0, first, last;
int main() {
cin >> n >> z;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
for (int k = i; k <= j; ++k) {
actS = actS + v[k];
++pos;
}
if (actS > maxS && pos >= z) {
maxS = actS;
first = i, last = j;
}
actS = 0;
pos = 0;
}
}
cout << first << ' ' << last << ' ' << maxS << '\n';
return 0;
}