Cod sursa(job #3151347)
Utilizator | Airinei Gabriel Vlad G3K0 | Data | 20 septembrie 2023 19:33:20 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
const int Nmax=5000005;
long long v[Nmax],deq[Nmax];
int main()
{long long n,k,s=0;
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
int fro=1,bac=0;
for(int i=1;i<=n;i++)
{
while(fro<=bac && v[i]<=v[deq[bac]])
bac--;
deq[++bac]=i;
if(i-k==deq[fro])
fro++;
if(i>=k)
s+=v[deq[fro]];
}
g<<s;
return 0;
}