Cod sursa(job #632664)
Utilizator | Daicu Alexandru Daicu | Data | 11 noiembrie 2011 22:31:15 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
#define maxn 5000010
using namespace std;
int dq[maxn],poz[maxn];
int n,k;
long long s=0;
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
int f=1,b=0;
for(int i=1;i<=n;i++){
scanf("%d",&poz[i]);
while(f<=b && poz[dq[b]]>=poz[i])
b--;
dq[++b]=i;
if((i-dq[f])>=k)
++f;
if(i>=k)
s+=poz[dq[f]];
}
printf("%lld",s);
return 0;
}