Pagini recente » Cod sursa (job #1705409) | Cod sursa (job #2202636) | Cod sursa (job #563121) | Cod sursa (job #1798187) | Cod sursa (job #2205234)
#include<cstdio>
#include<deque>
using namespace std;
deque <int> d1;
deque <int> d2;
int n,k,nr,i,h;
long long s;
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d%d",&n,&k,&nr);
d1.push_front(nr);
d2.push_front(1);
s=0;
h=2;
while(h<=k){
scanf("%d",&nr);
while(!d1.empty()&&nr<=d1.back()){
d1.pop_back();
d2.pop_back();
}
d1.push_back(nr);
d2.push_back(h);
h++;
}
s=s+d1.front();
for(i=k+1;i<=n;i++){
scanf("%d",&nr);
if(!d1.empty()&&d2.front()<i-k+1){
d1.pop_front();
d2.pop_front();
}
while(!d1.empty()&&nr<=d1.back()){
d1.pop_back();
d2.pop_back();
}
d1.push_back(nr);
d2.push_back(i);
s=s+d1.front();
}
printf("%lld",s);
return 0;
}