Cod sursa(job #2940375)
Utilizator | Data | 15 noiembrie 2022 13:56:33 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | cnilc1_2-dq | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,fr,b,v[500002],Q[500002],j,s,i;
int main()
{
f>>n>>k;
for(i=1; i<=n; i++)
{
f>>v[i];
} fr=1; b=0;
for(i=1;i<=n;i++)
{
while(fr<=b&&v[i]<=v[Q[b]])b--;
Q[++b]=i;
if(Q[fr]==i-k)fr++;
if(i>=k)s+=v[Q[fr]];
}
g<<s;
return 0;
}