Pagini recente » Cod sursa (job #1680994) | Rezultatele filtrării | Profil serj13 | Borderou de evaluare (job #258064) | Cod sursa (job #728325)
Cod sursa(job #728325)
#include <fstream>
#include <deque>
#include <vector>
using namespace std;
int main(){
long long n,i,k,s=0,x;
vector <long long> a;
deque <long long> d;
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
k--;
for(i=1;i<=n;i++){
f>>x;
a.push_back(x);}
d.push_front(0);
for(i=1;i<n;i++){
while(a[i]<a[d.back()])
d.pop_back();
d.push_back(i);
if(d.front()==i-k-1)
d.pop_front();
if(i>=k)
s=s+a[d.front()];}
g<<s;
f.close();
g.close();
return 0;}