Pagini recente » Cod sursa (job #364117) | Cod sursa (job #1926552) | Cod sursa (job #1932123) | Cod sursa (job #2620531) | Cod sursa (job #235567)
Cod sursa(job #235567)
#include <stdio.h>
int N, K, deque[5000005], v[5000005];
long long sum;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int i, p, u;
scanf("%d %d", &N, &K);
for (i = 1; i <= N; i++) scanf("%d", v + i);
p = 1; u = 0;
for (i = 1; i <= N; i++)
{
while (v[i] <= v[ deque[u] ] && u >= p) u--;
deque[++u] = i;
if (deque[p] == i - K) p++;
if (i >= K) sum += v[ deque[p] ];
}
printf("%lld\n",sum);
return 0;
}