Pagini recente » Cod sursa (job #2964695) | Cod sursa (job #52263) | Cod sursa (job #3219789) | Cod sursa (job #1680371) | Cod sursa (job #3258277)
#include <stdio.h>
#include <stdlib.h>
#define N 5000000
int v[N], d[N];
int main()
{
FILE *in, *out;
in = fopen("deque.in", "r");
out = fopen("deque.out", "w");
int n, k;
fscanf(in, "%d%d", &n, &k);
int st = 0, dr = -1;
long long suma = 0;
for (int i = 0; i < n; i++)
{
fscanf(in, "%d", &v[i]);
if (st <= dr && d[st] == i - k)
{
st++;
}
while (st <= dr && v[i] <= v[d[dr]])
{
dr--;
}
d[++dr] = i;
if (i >= k - 1)
{
suma += v[d[st]];
}
}
fprintf(out, "%lld\n", suma);
fclose(in);
fclose(out);
return 0;
}