Pagini recente » Cod sursa (job #2344125) | Cod sursa (job #1102716) | Cod sursa (job #2818253) | Cod sursa (job #2941160) | Cod sursa (job #624382)
Cod sursa(job #624382)
#include <stdio.h>
int n , i , p , u , k;
long long sum;
int D[5000004];
int V[5000004];
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&V[i]);
p=1;u=1;D[1]=1;
for(i=2;i<=n;i++){
while(p<=u&&V[D[u]]>=V[i])
u--;
D[++u]=i;
if((i-D[p])==k)
p++;
if(i>=k)
sum+=V[D[p]];
}
printf("%lld",sum);
return 0;
}