Cod sursa(job #1324587)
| Utilizator | Data | 22 ianuarie 2015 16:04:40 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <stdio.h>
#include <deque>
#define NMAX 5000003
using namespace std;
deque<int> dq;
int v[NMAX];
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int n,k;
long long sum=0;
scanf("%d %d",&n,&k);
for(int i=1;i<=n;++i)
scanf("%d",&v[i]);
for(int i=1;i<=n;++i){
while(!dq.empty() && v[i]<=dq.back())
dq.pop_back();
dq.push_back(v[i]);
if(dq.front==v[i-k])
dq.pop_front();
if(i>=k)
sum+=dq.front();
}
printf("%lld\n",sum);
return 0;
}
