Cod sursa(job #2579263)
| Utilizator | Data | 12 martie 2020 12:14:32 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include <bits/stdc++.h>
using namespace std;
int v[5000005],d[5000005];
int main()
{
ifstream cin("deque.in");
ofstream cout("deque.out");
int n,i,k,a,st,dr,l;
long long s;
cin>>n>>k;
st=1;
dr=1;
l=1;
for(i=1;i<=n;i++)
cin>>v[i];
d[1]=1;
for(i=2;i<=k;i++){
while(l>0 && v[i]<v[d[dr]])
{
dr--;
l--;
}
dr++;
l++;
d[dr]=i;
}
s=v[d[st]];
for(i=k+1;i<=n;i++){
while(l>0 && d[st]<i-k+1){
st++;
l--;
}
while(l>0 && v[i]<v[d[dr]]){
dr--;
l--;
}
dr++;
l++;
d[dr]=i;
s+=v[d[st]];
}
cout<<s;
return 0;
}
