Pagini recente » Cod sursa (job #1118077) | Cod sursa (job #1133255) | Cod sursa (job #2375424) | Cod sursa (job #1144983) | Cod sursa (job #2375427)
#include <bits/stdc++.h>
#define NMAX 5000005
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int deq[NMAX];
int A[NMAX];
int Front,Back;
int main()
{
int N,K,i;
long long S=0;
fin>>N>>K;
for(i=1;i<=N;++i)
fin>>A[i];
Front=1;
Back=0;
for(i=1;i<=N;++i)
{
while(Front<=Back && A[i]<=A[deq[Back]]) Back--;
deq[++Back]=i;
if(deq[Front]==i-K) Front++;
if(i>=K) S+=A[deq[Front]];
}
fout<<S<<"\n";
return 0;
}