Cod sursa(job #1844125)
| Utilizator | Data | 9 ianuarie 2017 19:17:59 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
#define secv{fscanf(f,"%d",&x);while(pq<=uq && x<=q[uq][0])uq--;q[++uq][0]=x;q[uq][1]=i;}
int q[5000010][2],pq,uq=-1;
int main()
{
int n,k,i,x;
long long s;
FILE *f=fopen("deque.in","r");
fscanf(f,"%d%d",&n,&k);
for(i=1;i<=k;i++)
secv;
s=q[pq][0];
for(i=k+1;i<=n;i++)
{
if(q[pq][1]<=i-k)pq++;
secv;
s+=q[pq][0];
}
f=fopen("deque.out","w");
fprintf(f,"%lld",s);
return 0;
}
