Cod sursa(job #2304570)
Utilizator | Data | 18 decembrie 2018 10:46:53 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int n,k,st,dr,v[10000000],dq[100000000],s=0;
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>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]];
}
}
cout<<s;
return 0;
}