Pagini recente » Cod sursa (job #2451498) | Cod sursa (job #1525296) | Cod sursa (job #1390450) | Cod sursa (job #1533233) | Cod sursa (job #1608134)
#include <cstdio>
#define longn 5000005
using namespace std;
int v[longn],deq[longn];
int n,k;
long long s;
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",&v[i]);
int Front=1,Back=0;
for (int i=1;i<=n;++i)
{
while (Front<=Back && v[i]<=v[deq[Back]])
--Back;
deq[++Back]=i;
if (deq[Front]==i-k)
Front++;
if (i>=k)
s+=v[deq[Front]];
}
printf("%lld",s);
return 0;
}