Cod sursa(job #1255270)
Utilizator | Data | 4 noiembrie 2014 16:43:57 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.8 kb |
#include<cstdio>
int j,k,s,i,n,u,p,x,a[5000009];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d%d",&n,&k,&x);
p=1;
u=1;
a[1]=x;
for(i=2;i<=n;i++)
{
scanf("%d",&x);
if(i==7)
i=7;
if(a[u]<=x)
{
u++;
a[u]=x;
}
else
{
while(a[u]>x&&p<=u)
{
u--;
}
u++;
a[u]=x;
}
if(u-p+1==k)
{
s=s+a[p];
printf("%d\n",a[p]);
p++;
}
/*for(j=p;j<=u;j++)
{
printf("%d ",a[j]);
}
printf("\n");*/
}
//printf("%d",s);
return 0;
}