Pagini recente » Cod sursa (job #1237479) | Cod sursa (job #1726521) | Cod sursa (job #1788388) | Cod sursa (job #215039) | Cod sursa (job #2907183)
#include <iostream>
using namespace std;
int n, k, kmax = -1, v[50002];
int main() {
cin >> n >> k;
int actS = 0, maxS = -25005, nr = 0, left = - 1, right = -3;
kmax = k;
for(int i = 1; i <= n; i++) {
cin >> v[i];
}
for(int i = 1; i <= n; ++i) {
for(int j = i; j <= n; ++j) {
actS = 0, nr = 0;
for(int k = i; k <= j; ++k) {
actS = actS + v[k];
++nr;
}
if(nr >= k && actS > maxS) {
maxS = actS;
left = i;
right = j;
}
}
}
cout << left << ' ' << right << ' ' << maxS;
return 0;
}