Pagini recente » Cod sursa (job #2263139) | Cod sursa (job #1343364) | Cod sursa (job #84914) | Cod sursa (job #169847) | Cod sursa (job #1804064)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
long long suma;
int nr, k, i, v[5000002];
deque <int> deq;
int main()
{
cin >> nr >> k;
for(i=1; i <= nr; i++)
cin >> v[i];
deq.push_back(1);
for(i=2; i <= nr; i++)
{
while(!deq.empty() && v[i] < v[deq.front()])
{
deq.pop_front();
}
deq.push_front(i);
if(i >= k)
suma += v[deq.back()];
while(!deq.empty() && deq.back() <= i-k+1)
deq.pop_back();
}
cout << suma;
}