Pagini recente » Cod sursa (job #1935841) | Cod sursa (job #43122) | Cod sursa (job #958217) | Cod sursa (job #3191685) | Cod sursa (job #652823)
Cod sursa(job #652823)
#include <fstream>
using namespace std;
int n,k,a[5000000];
int p[5000000];
int st,dr,i;
long long s;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for (i=1;i<=n;++i)
scanf("%d",&a[i]);
st=1;
dr=0;
for (i=1;i<=n;i++)
{
while ((st<=dr)&&(a[i]<=a[p[dr]]))
dr--;
p[++dr]=i;
if (p[st]==i-k)
st++;
if (i>=k)
s+=a[p[st]];
}
printf("%I64d\n",s);
return 0;
}