Cod sursa(job #240660)
Utilizator | Data | 8 ianuarie 2009 08:34:10 | |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <stdio.h>
struct stiva {long m;long p;};
long n,k,i,p,q,a[5000002];
long long sol;
stiva st[5000002];
int main(){
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%ld %ld",&n,&k);
for (i=1;i<=n;++i)
scanf("%ld",&a[i]);
p=1;q=0;
for (i=1;i<=n;++i){
while (a[i]<st[q].m&&q>=p)q--;
st[++q].m=a[i];
st[q].p=i;
while (i-st[p].p+1>k)p++;
if (i>=k)sol+=st[p].m;
}
printf("%lld\n",sol);
return 0;
}