Pagini recente » Cod sursa (job #1789972) | Cod sursa (job #1657008) | Cod sursa (job #1297755) | Cod sursa (job #1856880) | Cod sursa (job #1243384)
#include <fstream>
#include <deque>
#define DIM 5000005
#define MARE 10000001
using namespace std;
int n, k, a[DIM];
long long sum;
deque <int> d;
int main()
{
int i;
ifstream f("deque.in");
ofstream g("deque.out");
f >> n >> k;
for (i = 1; i <= n; ++i)
f >> a[i];
int m = MARE;
for (i = 1; i <= n; ++i) {
for (;!d.empty() && a[d.front()] >= a[i];)
d.pop_front();
d.push_back(i);
if (i >= k)
sum += a[d.front()];
if (d.front() == i - k + 1)
d.pop_front();
}
g << sum;
f.close();
g.close();
}