Cod sursa(job #2775849)
| Utilizator | Data | 17 septembrie 2021 16:55:20 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("deque.in");
ofstream fout ("deque.out");
void usain_bolt()
{
ios::sync_with_stdio(false);
fin.tie(0);
}
const int N = 5e6 + 5;
int dq[N], a[N];
int main()
{
usain_bolt();
int n, k, l = 1, r = 0;
long long sol = 0;
fin >> n >> k;
for(int i = 1; i <= n; ++i) {
fin >> a[i];
while(l <= r && a[i] <= a[dq[r]]) {
--r;
}
dq[++r] = i;
if(i - dq[l] == k) {
++l;
}
if(i >= k) sol += 1LL * a[dq[l]];
}
fout << sol;
return 0;
}
