Pagini recente » Cod sursa (job #440822) | Cod sursa (job #523459) | Cod sursa (job #52210) | Cod sursa (job #3259608) | Cod sursa (job #2312665)
#include <fstream>
#define NM 5000003
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long n,k,i,bk,sum,fr;
int dq[NM],a[NM];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++) f>>a[i];
bk=0; fr=1;
for(i=1;i<=n;i++){
while(fr<=bk&&a[i]<=a[dq[bk]]) bk--;
dq[++bk]=i;
if(dq[fr]==i-k) fr++;
if(i>=k) sum+=a[dq[fr]];
}
g<<sum<<'\n';
return 0;
}