Pagini recente » Cod sursa (job #1412693) | Cod sursa (job #2375060) | Cod sursa (job #404657) | Cod sursa (job #2982143) | Cod sursa (job #2034035)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 50005
int n, k, a[NMAX], s[NMAX];
void citire() {
scanf("%d %d ", &n, &k);
for(int i = 1; i <= n; i++) {
scanf("%d ", &a[i]);
s[i] = s[i - 1] + a[i];
}
}
int maxim, minim, pmax, pmin;
void rezolvare() {
maxim = s[k], pmax = k, minim = 0;
for(int i = 1; i <= n; i++) {
if(maxim < s[i + k] - minim) {
maxim = s[i + k] - minim;
pmax = i + k;
}
if(minim > s[i]) {
minim = s[i];
pmin = i + 1;
}
}
printf("%d %d %d\n", pmin, pmax, maxim);
}
int main() {
freopen("secv2.in", "r", stdin);
freopen("secv2.out", "w", stdout);
citire();
rezolvare();
return 0;
}