Cod sursa(job #2731845)
Utilizator | Data | 28 martie 2021 13:54:01 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int v[5000001], deq[5000001], n, k;
long long suma;
int main()
{
int i, dr=0, st=1;
f >> n >> k;
for(i=1; i<=n; i++)
f >> v[i];
for(i=1; i<=n; i++)
{
while(st<=dr && v[i]<=v[deq[dr]])
dr--;
deq[++dr]=i;
if(deq[st] == i-k)
st++;
if(i>=k)
suma=suma+v[deq[st]];
}
g<<suma;
return 0;
}