Pagini recente » Cod sursa (job #2887355) | Cod sursa (job #2807914) | Cod sursa (job #847100) | Cod sursa (job #1382647) | Cod sursa (job #2174046)
#include <fstream>
#include <deque>
using namespace std;
int a[100002];
deque <int> dq;
int main()
{
int n,k,suma;
ifstream in("deque.in");
ofstream out("deque.out");
in>>n>>k;
for(int i=1;i<=n;i++)
{
in>>a[i];
}
suma=0;
for(int i=1;i<=n;i++)
{
while(!dq.empty()&&a[i]<=a[dq.back()])
dq.pop_back();
dq.push_back(i);
if(dq.front()==i-k)
dq.pop_front();
if(i>=k)
{
suma+=a[dq.front()];
}
}
out<<suma;
return 0;
}