Cod sursa(job #2719599)
| Utilizator | Data | 10 martie 2021 00:10:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <deque>
/**L9 GANG LEADER
WHEN THE IMPOSTOR IS SUS?????? SOLOBOLO
*/
using namespace std;
string files="deque";
ifstream in(files+".in");
ofstream out(files+".out");
deque<int> dq;
int v[5000001];
int main()
{
int n,k;
in>>n>>k;
long long sol=0;
for(int i=1;i<=n;i++)
{
in>>v[i];
while(!dq.empty()&&v[dq.back()]>=v[i])
dq.pop_back();
dq.push_back(i);
if(i-dq.front()>=k)
dq.pop_front();
if(i>=k)
sol=sol+1LL*v[dq.front()];
}
out<<sol;
return 0;
}
