Pagini recente » Cod sursa (job #762050) | Cod sursa (job #698794) | Cod sursa (job #1851027) | Cod sursa (job #669562) | Cod sursa (job #2304575)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int n,k,st,dr,v[10000000],dq[100000000],s=0;
int main()
{
in>>n>>k;
for(int i=0;i<n;i++)
in>>v[i];
st=0;dr=-1;
for(int i=0;i<n;i++){
if(st<=dr && dq[st]==i-k){
st++;
}
while(st<=dr && v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
if(i>=k-1){
s+=v[dq[st]];
}
}
out<<s;
return 0;
}