Cod sursa(job #1066704)
Utilizator | Data | 25 decembrie 2013 14:34:16 | |
---|---|---|---|
Problema | Deque | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include <deque>
using namespace std;
main(){
ifstream fin("deque.in");
ofstream fout("deque.out");
int k,n,i;
signed long long a[150000],s=0;
fin>>n;fin>>k;
std::deque<int> fifth;
for(i=1;i<=n;++i){
fin>>a[i];
while(!fifth.empty() && a[fifth.back()]>=a[i])fifth.pop_back();
fifth.push_back(i);
if(fifth.front()==i-k)fifth.pop_front();
if(i-k>=0)s+=a[fifth.front()];
}
fout<<s;
fin.close(); fout.close();
}