Pagini recente » Cod sursa (job #1914770) | Cod sursa (job #16914) | Cod sursa (job #2704525) | Cod sursa (job #1772553) | Cod sursa (job #1607746)
#include <cstdio>
#include <deque>
using namespace std;
deque <int> d;
int n, k, a[5000002], sum, i;
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
scanf("%d%d", &n, &k);
for(i=1; i<=n; i++) scanf("%d", &a[i]);
for(i=1; i<=n; i++){
while(!d.empty() and a[i]<=a[d.back()])
d.pop_back();
d.push_back(i);
while(d.front()<=i-k) d.pop_front();
if(i>=k){
printf("%d\n", a[d.front()]);
sum+=a[d.front()]; }
}
printf("%d", sum);
return 0;
}