Cod sursa(job #3214439)
Utilizator | Data | 14 martie 2024 09:32:13 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
long long sum;
int v[5000002],n,k;
deque<int>q;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>v[i];
while(!q.empty()&&i-q.front()>=k)
q.pop_front();
while(!q.empty()&&v[i]<v[q.back()])
q.pop_back();
q.push_back(i);
if(i>=k)
sum+=v[q.front()];
}
cout<<sum;
return 0;
}