Cod sursa(job #2722685)
Utilizator | Data | 13 martie 2021 10:46:01 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
int v[5000005],dequee[5000005],n,ans,k;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>v[i];
int st=1,dr=0;
for(int i=1;i<=n;i++)
{
while(v[i]<=v[dequee[dr]]&&st<=dr)
dr--;
dequee[++dr]=i;
if(dequee[st]==i-k)
st++;
if(i>=k)
ans+=v[dequee[st]];
}
cout<<ans;
}