Cod sursa(job #3211219)
Utilizator | Petrisor Stefan PETRISOR_STEFAN | Data | 8 martie 2024 18:58:52 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
struct aragaz
{
int poz;
int val;
};
int n,k;
int z;
deque<aragaz> dq;
int main()
{
fin >> n >> k;
for (int i = 1; i <= n; i++)
{
int a;
fin >> a;
while (!dq.empty() && dq.back().val > a)
{
dq.pop_back();
}
dq.push_back({i,a});
while (!dq.empty() && dq.front().poz == i - k)
{
dq.pop_front();
}
if (i >= k && n >= i)
z += dq.front().val;
}
fout << z;
return 0;
}