Cod sursa(job #2889505)
| Utilizator | Data | 12 aprilie 2022 20:49:28 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int main()
{
int v[250001], coada[250001], inceput, sfarsit, n, k, suma=0, i;
f>>n>>k;
for(i=0;i<n;i++)
f>>v[i];
inceput=0;
sfarsit=-1;
for(int i=0;i<n;i++)
{
while(inceput<=sfarsit && v[i]<v[coada[sfarsit]])
{
sfarsit--;
}
coada[++sfarsit] = i;
if(coada[inceput]==i-k) inceput++;
if(i>=k-1) suma+=v[coada[inceput]];
}
g<<suma;
}
