Pagini recente » Cod sursa (job #1703560) | Cod sursa (job #2743047) | Cod sursa (job #1563045) | Cod sursa (job #132582) | Cod sursa (job #2227427)
#include <stdio.h>
#define BUFFER_SIZE 1 << 17
int p = 0;
char buffer[BUFFER_SIZE];
__attribute__((always_inline)) int get_int()
{
int number = 0; char sign = '+';
while(buffer[p] < '0')
{
sign = buffer[p++];
if(p == BUFFER_SIZE)
{
fread(buffer, 1, BUFFER_SIZE, stdin);
p = 0;
}
}
while(buffer[p] > '/')
{
number = number * 10 + buffer[p++] - 48;
if(p == BUFFER_SIZE)
{
fread(buffer, 1, BUFFER_SIZE, stdin);
p = 0;
}
}
if(sign == '-') number = -number;
return number;
}
int v[5000001]
int deque[5000001];
int main()
{
int N, K, front = 1, back = 0;
long long sum = 0;
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
N = get_int(); K = get_int();
for(int i = 1; i <= N; i++)
{
v[i] = get_int();
}
for(int i = 1; i < K; i++)
{
while(front <= back && v[i] <= v[deque[back]])
{
back--;
}
deque[++back] = i;
}
for(int i = K; i <= N; i++)
{
while(front <= back && v[i] <= v[deque[back]])
{
back--;
}
deque[++back] = i;
if(deque[front] == i - K) front++;
sum += v[deque[front]];
}
printf("%lld", sum);
return 0;
}