Pagini recente » Istoria paginii preoni-2008/clasament | Profil Djok | Cod sursa (job #1374038) | Cod sursa (job #2885379) | Cod sursa (job #1632031)
#include <stdio.h>
int b,e;
int v[5000001];
int dq[5000001];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int n,k,i,j;
long long sum = 0;
scanf("%d %d\n",&n,&k);
for(i = 1; i <= n; ++i)
scanf("%d",&v[i]);
b = 0; e = 0;
for(i = 1; i <= n; ++i)
{
while(b <= e && v[dq[e]] >= v[i])
--e;
dq[++e] = i;
if(dq[b] == i - k)
++b;
if(i >= k)
sum += v[dq[b]];
}
printf("%d\n",sum);
return 0;
}