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