Cod sursa(job #2802917)
| Utilizator | Data | 19 noiembrie 2021 08:54:45 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> d;
const int NMAX=500000;
int v[NMAX+5];
int n,k;
void citire()
{
fin>>n>>k;
for(int i=1;i<=n;++i)
fin>>v[i];
}
int main()
{
citire();
int s=0;
for(int i=1;i<=n;++i)
{
if(!d.empty() and d.front()==i-k)
d.pop_front();
while(!d.empty() and v[d.back()]>=v[i])
d.pop_back();
d.push_back(i);
if(i>=k)
s+=v[d.front()],fout<<v[d.front()]<<' ';
}
fout<<s<<' ';
}
