Pagini recente » Cod sursa (job #599177) | Cod sursa (job #1970215) | Borderou de evaluare (job #431336) | Cod sursa (job #2527577) | Cod sursa (job #2162702)
#include <stdio.h>
#include <iostream>
#include <deque>
using namespace std;
FILE *f,*g;
int v[5000009];
int q[5000009];
int main()
{
int n,k,i,j,x,y,ss=0,ps=1,pi=0;
f=fopen("deque.in","r");
g=fopen("deque.out","w");
fscanf(f,"%d %d",&n,&k);
for(i=1;i<=n;++i)
fscanf(f,"%d",&v[i]);
for(i=1;i<=n;++i)
{
while(ps<=pi && v[i]<=v[q[pi]])
--pi;
q[++pi]=i;
if(i>=k)
ss+=v[q[ps]];
if(q[ps]==i-k+1)
++ps;
}
fprintf(g,"%d",ss);
fclose(f);
fclose(g);
return 0;
}