2017.11.1模拟 queue

http://www.elijahqi.win/archives/1464

#include<cstdio>
#include<algorithm>
#define N 11000000
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=gc();}
    while (ch<='9'&&ch>='0'){x=x*10+ch-'0';ch=gc();}
    return x*f;
}
int n,a[N],first,last;
int main(){
    //freopen("queue.in","r",stdin);
    n=read();int first=10000000>>1,last=first-1;
    for (int i=1;i<=n;++i){
        int x=read();
        if (x>0) a[--first]=x;
        if (x==-1) if (a[first]) printf("%d\n",a[first++]);
        if (x==0){
            if (last-first+1>=n-i) continue;int last1=last;
            for (int j=first;j<=last1;++j) a[++last]=a[j];
        }
    }
    return 0;
}

按照题意模拟即可 注意剪枝 即当我要复制的队列大小超过我剩余询问数时直接跳过 不去管他即可