Cod sursa(job #2323042)
Utilizator | Data | 18 ianuarie 2019 18:54:27 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
int v[5000000];
int dq[5000000];
int n,k;
int st = 0, dr = -1;
long long s = 0;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>v[i];
}
for(int i=0;i<n;i++){
if(st<=dr && dq[st]==i-k){
st++;
}
while(st<=dr && v[i]<=v[dq[dr]]){
dr--;
}
dq[++dr]=i;
if(i>=k-1){
s+=v[dq[st]];
}
}
cout<<s;
return 0;
}