Pagini recente » Cod sursa (job #92513) | Cod sursa (job #1093992) | Cod sursa (job #2839383) | Rating Popa Felicia (PopaFelicia) | Cod sursa (job #2658919)
#include<fstream>
using namespace std;
ifstream cin ("secv2.in");
ofstream cout ("secv2.out");
int s[50005];
int main() {
int n, k, x, pozin, pozsf, l, best;
cin >> n >> k;
for (int i = 1; i <= k; i++) {
cin >> x;
s[i] = s[i - 1] + x;
}
best = s[k];
pozin = 1;
pozsf = k;
int in = 1;
for (int i = k + 1; i <= n; i++) {
cin >> x;
s[i] = s[i - 1] + x;
if (s[i - k + 1] - s[in - 1] <= 0) {
in = i - k + 1;
}
if(s[i] - s[in - 1] > best){
best = s[i] - s[in - 1];
pozin = in;
pozsf = i;
}
}
cout << pozin << " " << pozsf << " " << best;
}