Cod sursa(job #2887452)
Utilizator | Data | 9 aprilie 2022 17:28:11 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
ifstream fin("deque.in");
ofstream fout("deque.out");
using namespace std;
int main()
{
int n, k,stanga,dreapta;
int v[5000000];
long long s=0;
cin>>n>>k;
int dq[5000000];
for(int i = 1; i <= n; i++) {
cin>>v[i];
}
stanga=0;
dreapta=-1;
for(int i = 1; i <= n; i++) {
while(stanga<=dreapta && v[i] <= v[dq[dreapta]])
{
dreapta--;
}
dreapta++;
dq[dreapta]=i;
if(i >= k) {
s += v[dq[stanga]];
if(dq[stanga] == i - k + 1) {
stanga++;
}
}
}
cout<<s;
return 0;
}