Cod sursa(job #1703080)
Utilizator | Data | 16 mai 2016 09:47:33 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
#define Nmax 5000005
deque <int> q;
int n,k,minn,v[Nmax];
long long s;
int main()
{
in>>n>>k;
for(int i=1;i<=n;i++){
in>>v[i];
}
for(int i=1;i<=n;i++){
while(!q.empty() && v[i] < v[q.back()])q.pop_back();
q.push_back(i);
if(q.front() <= i-k)q.pop_front();
if(i >= k) s+=v[q.front()];
}
out<<s;
return 0;
}