Pagini recente » Cod sursa (job #587641) | Cod sursa (job #1382733) | Cod sursa (job #1719512) | Cod sursa (job #151689) | Cod sursa (job #2098336)
#include <fstream>
#include <deque>
#define limit 5000010
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
deque <int> d;
int n, k, v[limit];
long int sum;
int main()
{
int i;
in >> n >> k;
for (i = 1; i <= n; i++) in >> v[i];
for (i = 1; i <= n; i++) {
while (!d.empty() && v[i] <= v[d.back()]) d.pop_back();
d.push_back(i);
if (d.front() == i - k) d.pop_front();
if (i >= k) sum += v[d.front()];
}
out << sum;
in.close();
out.close();
return 0;
}