Pagini recente » Cod sursa (job #280466) | Cod sursa (job #1331003) | Cod sursa (job #336631) | Cod sursa (job #543270) | Cod sursa (job #1050999)
#include <iostream>
#include<fstream>
#include<deque>
#include<stdint.h>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int main()
{
int i,n,k,v[100000], suma=0;
deque <int> my_deq;
f>>n>>k;
for(i=0;i<n;i++)
{
f>>v[i];
while (my_deq.size() && v[my_deq.back()]>=v[i])
my_deq.pop_back();
my_deq.push_back(i);
if(my_deq.front()==i-k)
my_deq.pop_front();
if(i>=k-1)
suma +=v[my_deq.front()];
}
g<<suma;
return 0;
}