Cod sursa(job #1255153)
| Utilizator | Data | 4 noiembrie 2014 13:52:31 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<cstdio>
int s,u,p,a[5000007],i,n,k,x;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
p=1;
u=1;
a[1]=-1000000;
for(i=1;i<=n;i++)
{
scanf("%d",&x);
if(a[u]<=x)
{
a[u]=x;
u++;
}
else
{
while(a[u]>x)
{
u--;
}
a[u]=x;
}
if(u-p+1==k)
{
printf("%d\n",a[p]);
s+=a[p];
p++;
}
}
printf("%d",s);
return 0;
}
