Pagini recente » Cod sursa (job #2842582) | Cod sursa (job #2308203) | Cod sursa (job #1063558) | Cod sursa (job #2320004) | Cod sursa (job #1594074)
#include <fstream>
#include <cstdio>
#define NMax 5000005
using namespace std;
int n,k;
int a[NMax],q[NMax];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; ++i){
scanf("%d",&a[i]);
}
int s = 0;
int fr = 1, bk = 0;
for(int i = 1; i <= n; ++i){
while(fr <= bk && a[i] <= a[q[bk]]){
bk--;
}
q[++bk] = i;
if(q[fr] == i - k){
fr++;
}
if(i >= k)
s += a[q[fr]];
}
printf("%d",s);
return 0;
}