Pagini recente » Cod sursa (job #2032326) | Cod sursa (job #2297985) | Cod sursa (job #1019108) | Cod sursa (job #2868208) | Cod sursa (job #2304572)
#include <iostream>
#include <fstream>
ifstream in("deque.in");
ofstream out("deque.out");
using namespace std;
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;
}