Pagini recente » Cod sursa (job #1414197) | Cod sursa (job #599891) | Cod sursa (job #1000430) | Cod sursa (job #231277) | Cod sursa (job #239692)
Cod sursa(job #239692)
#include<stdio.h>
#define N 5000010
int n,k,a[N],d[N];
long long rez;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int p=1,u=0;
scanf("%d%d",&n,&k);
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
if(p<=u && i-d[p]>=k)
p++;
while(p<=u && a[i]<=a[d[u]])
u--;
d[++u]=i;
if(i>=k)
rez+=(long long)a[d[p]];
}
printf("%lld\n",rez);
return 0;
}