Cod sursa(job #1409951)
| Utilizator | Data | 30 martie 2015 19:48:07 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
using namespace std;
long long int v[5000001],de[5000001];
int main(){
long long int n,st,dr,sum,i,k;
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
scanf("%lld %lld",&n,&k);
for(i = 1;i <= n;i++){
scanf("%lld",&v[i]);
}
st = 0;
dr = sum = 0;
for(i = 1;i <= n;i++){
while(st <= dr && v[i] <= v[de[dr]]){
dr--;
}
de[++dr] = i;
if(de[st] == i-k){
st++;
}
if(i >= k){
sum += v[de[st]];
}
}
printf("%lld\n",sum);
return 0;
}
