Cod sursa(job #3128090)
| Utilizator | Data | 8 mai 2023 16:52:57 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001], temp[5000000];
int main() {
ifstream f("deque.in");
ofstream g("deque.out");
int n, k,st=0,dr=0;
f >> n >> k;
int st = 0, dr = 0;
float suma = 0;
for (int i = 0; i < n; i++)
f >> v[i];
for (int i = 0; i < n; i++) {
while (st <= dr && v[i] <= v[temp[dr]]) {
--dr;
}
++dr;
temp[dr] = i;
if (k - i < 1 - temp[st]) {
++st;
}
if (i >= k) {
suma = suma + v[temp[st]];
}
}
g << suma;
f.close();
g.close();
return 0;
}