Cod sursa(job #3218467)
Utilizator | Petre Ionut PetreIonut | Data | 27 martie 2024 11:39:19 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
deque <long long int> d;
long long int n, x, k, nr, s, h, a[5000005];
ifstream f("deque.in");
ofstream g("deque.out");
int main()
{
f >> n >> k;
for(int i=1; i<=n; i++)
{
f >> a[i];
while(!d.empty() && d.back()<=i-k) d.pop_back();
while(!d.empty() && a[d.front()]>a[i]) d.pop_front();
d.push_front(i);
if(i>=k) s+=a[d.back()];
}
g << s;
}