Cod sursa(job #2832792)
Utilizator | Gabriel Stefan Tita gabriel.9619 | Data | 14 ianuarie 2022 12:14:42 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[5000005];
deque <int> dq;
int main()
{
int n, i, k;
long long s=0;
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
dq.push_back(1);
for(i=2;i<=n;i++)
{
while(!dq.empty()&&v[i]<=v[dq.back()])
{
dq.pop_back();
}
dq.push_back(i);
if(i-dq.front()==k)
{
dq.pop_front();
}
if(i>=k)
{
s+=v[dq.front()];
}
}
fout<<s;
return 0;
}