Pagini recente » Cod sursa (job #1237887) | Cod sursa (job #2415271) | Cod sursa (job #712484) | Istoria paginii runda/pregatire_oji_3/clasament | Cod sursa (job #2037577)
#include <bits/stdc++.h>
using namespace std;
char v[1000000],d[1000000];
int main()
{
int n,k,st=0,dr,s=0,i;
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d", &n, &k);
dr=n;
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;
}