Pagini recente » Cod sursa (job #379404) | Cod sursa (job #251111) | Cod sursa (job #3139789) | Cod sursa (job #2542988) | Cod sursa (job #870073)
Cod sursa(job #870073)
#include <stdio.h>
using namespace std;
int n,a[5000005],q[5000005],i,h=1,t=0,k;
long long int s=0;
main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;++i){
scanf("%d",&a[i]);
if(q[h]==i-k) h++;
while(h<=t&&a[i]<=a[q[t]]) t--;
q[++t]=i;
if(i>=k) s+=a[q[h]];}
printf("%lld\n",s);
}