Pagini recente » Cod sursa (job #484208) | Cod sursa (job #2335343) | Cod sursa (job #1039499) | Cod sursa (job #555279) | Cod sursa (job #1076781)
/*
~Keep It Simple!~
*/
#include <stdio.h>
#define Mn 5000005
int n,m;
int A[Mn],Deque[Mn];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&A[i]);
long long s = 0;
int Front = 1, Back = 0;
for(int i=1; i<=n; i++)
{
while( Front <= Back && A[i] <= A[Deque[Back]])
Back--;
Deque[++Back] = i;
if( i-m == Deque[Front] )
Front++;
if( i>=m )
s += A[Deque[Front]];
}
printf("%d",s);
}