Cod sursa(job #2568619)
Utilizator | Andrei Bogos bogosanu | Data | 4 martie 2020 08:44:52 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
deque <int> dq;
long long a[5000005];
int n,k;
int main()
{int i;
fin>>n>>k;
int f,b;
int s=0;
for(i=1;i<=n;++i)
fin>>a[i];
f=1; b=0;
for(i=1;i<=n;++i)
{while(f<=b && a[i]<=a[dq[b]])
b--;
dq[++b]=i;
if(dq[f]==i-k) f++;
if(i>=k)
s+=a[dq[f]];
}
fout<<s;
return 0;
}