Pagini recente » Cod sursa (job #995396) | Cod sursa (job #2203336) | Cod sursa (job #2055233) | Cod sursa (job #2954320) | Cod sursa (job #1059165)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int A[5000010],Deque[5000010];
int main()
{
int N,K, s=0, i, fr, bk;
fin>>N>>K;
for(i=1;i<=N;i++)
fin>>A[i];
fr=1; bk=0;
for(i=1;i<=N;i++)
{
while(fr<=bk && A[i]<=A[Deque[bk]])
bk--;
Deque[++bk]=i;
if(Deque[fr]==i-K)
fr++;
if(i>=K)
s=s+ A[Deque[fr]];
}
fout<<s;
return 0;
}