Cod sursa(job #350752)
| Utilizator | Data | 25 septembrie 2009 19:15:17 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
long n,k,i,x,st,dr,q[5000000],s;
long poz[5000000];
void rez()
{
scanf("%ld %ld",&n,&k);
st=1;
for(i=1;i<=k;++i)
{
scanf("%ld",&x);
while(x<q[dr] && dr>=st) dr--;
q[++dr]=x;
poz[dr]=i;
}
for(i=k+1;i<=n;++i)
{
scanf("%ld",&x);
if(poz[st]>=i-k)
{
s+=q[st];
st++;
}
while(x<q[dr] && dr>=st) dr--;
q[++dr]=x;
poz[dr]=i;
}
printf("%ld\n",&s);
}
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
rez();
return 0;
}
