Cod sursa(job #2864245)
| Utilizator | Data | 7 martie 2022 18:35:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("bmatrix.in");
ofstream g("bmatrix.out");
long long v[500002];
deque <int> d;
int main()
{int n,k;
long long sol=0;
f>>n>>k;
for (int i=1;i<=n;i++) f>>v[i];
for (int i=1;i<=n;i++) {if (!d.empty() && d.front()==i-k) d.pop_front();
while (!d.empty() && v[i]<v[d.back()]) d.pop_back();
d.push_back(i);
if (i>=k) sol+=v[d.front()];
}
g<<sol;
}
