Pagini recente » Borderou de evaluare (job #2110578) | Cod sursa (job #427630) | Cod sursa (job #2986351) | Diferente pentru problema/joctv intre reviziile 2 si 5 | Cod sursa (job #2037583)
#include <bits/stdc++.h>
using namespace std;
int v[5000001],d[5000001];
int main()
{
int n,k,st=0,dr=0,s=0,i;
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d", &n, &k);
for (i=0;i<n;i++) {
scanf("%d", &v[i]);
if (d[st]==i-k)
st++;
while (st<=dr && v[i]<=v[d[dr]])
dr--;
d[++dr]=i;
if (i>=k-1)
s+=v[d[st]];
}
printf("%d", s);
return 0;
}