Pagini recente » Cod sursa (job #406517) | Solutii preONI 2007, Runda 4 | Cod sursa (job #2312853) | Cod sursa (job #2891613) | Cod sursa (job #2730792)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int main()
{
int n;
int k;
int sum = 0;
int* a;
int* deq;
int s = 0 ,d = -1;
in >> n >> k;
a = new int[n+1];
deq = new int[n+1];
for(int i=0; i<n; i++)
in >> a[i];
for(int i=0; i<n; i++)
{
while(s <= d && a[i] <= a[deq[d]])
d--;
deq[++d] = i;
if(deq[s] == i-k)
s++;
if(i >= k-1)
sum = sum + a[deq[s]];
}
out << sum;
delete[] a;
delete[] deq;
in.close();
out.close();
return 0;
}