Pagini recente » Sedinta 2008-11-25 | Cod sursa (job #197918) | Istoria paginii runda/balaura_round1 | Ședință 2009-10-23 | Cod sursa (job #271843)
Cod sursa(job #271843)
#include<iostream.h>
#include<stdio.h>
int A[5000001],deque[5000001];
unsigned int n,k,i,front=1,back=0;
long long s=0;
int main()
{
freopen("D:\\in.txt","r",stdin);freopen("D:\\out.txt","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&A[i]);
for(i=1;i<=n;i++)
{
while(front<=back && A[i]<=A[deque[back]])
back--;
deque[++back]=i;
if(deque[front]==i-k)
front++;
if(i>=k)
s+=A[deque[front]];
}
printf("%lld",s);
return 0;
}