Pagini recente » Cod sursa (job #2278792) | Cod sursa (job #510743) | Cod sursa (job #2804067) | Cod sursa (job #670909) | Cod sursa (job #1324566)
#include <stdio.h>
#include <deque>
#define NMAX 5000003
using namespace std;
deque<int> dq;
int v[NMAX];
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int n,k,sum=0;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
scanf("%d",&v[i]);
for(int i=1;i<=n;++i){
while(!dq.empty() && v[i]<=dq.back())
dq.pop_back();
dq.push_back(v[i]);
if(dq.front()==v[i-k])
dq.pop_front();
if(i>=k)
sum+=dq.front();
}
printf("%d\n",sum);
return 0;
}