Pagini recente » Cod sursa (job #1799596) | Monitorul de evaluare | Cod sursa (job #2363989) | Cod sursa (job #3200740) | Cod sursa (job #2681490)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
deque<int>h;
int v[5000001];
int main()
{
int n, k, suma=0, i;
fin>>n>>k;
for(i=1; i<=n; i++)fin>>v[i];
for(i=1; i<=n; i++)
{
while(!h.empty() && v[i]<=v[h.back()]) h.pop_back();
h.push_back(i);
if(h.front()==i-k) h.pop_front();
if(i>=k) suma+=v[h.front()];
}
fout<<suma;
}