Pagini recente » Cod sursa (job #2982097) | Cod sursa (job #923068) | Cod sursa (job #2922449) | Cod sursa (job #2401750) | Cod sursa (job #2178574)
#include <bits/stdc++.h>
using namespace std;
#define N 50010
int n, k, a[N], s[N], mn, t, bst, st, dr, stt, drr;
int main(){
ifstream cin ("secv2.in");
ofstream cout ("secv2.out");
cin >> n >> k;
for (int i=1; i<=n; i++) cin >> a[i], s[i] = s[i-1] + a[i];
st = stt = 1; dr = drr = k;
bst = t = s[k];
for (int i=k+1; i<=n; i++){
if (t + a[i] >= s[i] - s[i-k]) t += a[i], drr = i;
else t = s[i] - s[i-k], stt = i - k +1, drr = i;
if (t > bst) bst = t, st = stt, dr = drr;
cout << stt << " " << dr << " " << t << "\n";
}
cout << st << " " << dr << " " << bst;
return 0;
}