Pagini recente » Cod sursa (job #275872) | Cod sursa (job #635966) | Cod sursa (job #520163) | Cod sursa (job #2541121) | Cod sursa (job #2041690)
#include <fstream>
#include <deque>
#define mx 5000001
using namespace std;
deque < pair<int,int> > coada;
int a[mx],k,suma,n,x;
ifstream fin("deque.in");
ofstream fout("deque.out");
int main (){
int i;
fin>>n>>k;
for (i=1; i<=n; i++){
fin>>x;
while ((!coada.empty()) && (x<coada.back().first))
coada.pop_back();
coada.push_back({x,i});
if (coada.front().second <= i-k) coada.pop_front();
if (i >= k) suma+=coada.front().first;
}
fout<<suma;
return 0;
}