Cod sursa(job #2732274)
Utilizator | Axinte Teodor TeodorAxinte | Data | 28 martie 2021 20:50:59 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int arr[5000001], deq[5000001];
int s, n, k, st, dr;
int main() {
f >> n >> k;
for (int i = 1; i <= n; i++)
{
f >> arr[i];
//g<<arr[i]<<" ";
}
for (int i = 1; i <= n; i++) {
while (st <= dr && arr[i] <= arr[deq[dr]])
dr--;
deq[++dr] = i;
if (deq[st] <= i - k)
st++;
if (i >= k)
s += arr[deq[st]];
}
g << s;
return 0;
}