Pagini recente » Cod sursa (job #2605150) | Cod sursa (job #2810338) | Cod sursa (job #2112777) | Cod sursa (job #2808564) | Cod sursa (job #2727595)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
struct ddeque{
int val,poz;
};
int main(){
int n,k;
f>>n>>k;
ddeque Deq[n];
int fr=1,bk=0;
long long sum=0;
for(int i=1;i<=n;i++)
f>>Deq[i].val;
for(int i=1;i<=n;i++){
while(fr<=bk&&Deq[i].val<=Deq[Deq[bk].poz].val)
bk--;
Deq[++bk].poz=i;
if(Deq[fr].poz==i-k) fr++;
if(i>=k)
sum+=Deq[Deq[fr].poz].val;
}
g << sum ;
return 0;
}