Pagini recente » Cod sursa (job #2490456) | Cod sursa (job #502835) | Cod sursa (job #788695) | Cod sursa (job #1308187) | Cod sursa (job #2888783)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
int suma = 0, n, k, curent, * minim = nullptr, * poz = nullptr, inceput = 1, final = 0;
fin >> n >> k;
minim = new int[n];
poz = new int[n];
for (int i = 1; i <= n; i++) {
fin >> curent;
while (final > inceput && minim[final] >= curent) --final;
final++;
minim[final] = curent;
poz[final] = i;
if (poz[inceput] <= i - k) inceput++;
if (i >= k) suma += minim[poz[inceput]];
}
fout << suma;
fin.close();
fout.close();
}