Pagini recente » Cod sursa (job #423173) | Cod sursa (job #2385023) | Cod sursa (job #2156243) | Cod sursa (job #1967893) | Cod sursa (job #593720)
Cod sursa(job #593720)
#include<stdio.h>
int n,u,p,k,v[5000002],d[5000002];
long long s;
int main()
{
int i;
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;
for(i=1;i<=n;i++)
{
while(p<=u && v[d[u]] >= v[i])
u--;
u++;
d[u]=i;
if(i-d[p]>=k)
p++;
if(i>=k)
s = s+v[d[p]];
}
printf("%lld",s);
return 0;
}