单调队列入门 foj 1894 http://acm.fzu.edu.cn/problem.php?pid=1894

第一次做，模仿着敲的

View Code

#include<stdio.h>
#include<string.h>
#define maxn 1000000
struct que{
    int x,val;
    que(int xx,int yy):x(xx),val(yy){}
    que(){};
}q[maxn];
int main()
{
    int t;
    char name[6],na[10];
    int rp;
    scanf("%d",&t);
    while(t--)
    {
        int i,j,k,head=0,tail=-1,leave=0,K=1;
        scanf("%*s");
        while(scanf("%s",name)!=EOF)
        {
            if(strcmp(name,"END")==0) break;
            if(name[0]=='C')
            {
                scanf("%s%d",na,&rp);
                while(tail>=head&&q[tail].val<=rp) tail--;
                que now(K++,rp);
                q[++tail]=now;
            }
            else if(name[0]=='Q')
            {
                while(tail>=head&&q[head].x<=leave) head++;
                if(tail>=head) printf("%d\n",q[head].val);
                else printf("-1\n");
            }
            else leave++;
        }
    }
    return 0;
}