Pagini recente » Cod sursa (job #2005694) | Cod sursa (job #1944288) | Cod sursa (job #2153279) | Cod sursa (job #199720) | Cod sursa (job #655238)
Cod sursa(job #655238)
#include <stdio.h>
#define max 5000010
int n , i , a[max] , deque[max] , front , back , k;
long long sum;
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 " , &a[i]);
front = 1; back = 0;
for(i = 1 ; i <= n ; i++)
{
while(front <= back && a[i] < a[deque[back]])
back--;
deque[++back] = i;
if(deque[front] == i-k)
front++;
if(i >= k)
sum += a[deque[front]];
}
printf("%lld" , sum);
fclose(stdin);
fclose(stdout);
return 0;
}