【杭电oj1702】ACboy needs your help again!

我会带着你远行 2022-09-24 13:17 112阅读 0赞

![这里写图片描述][20160801083947510]  
![这里写图片描述][20160801083955604]  
![这里写图片描述][20160801084005089]

栈与队列的模板题，重在学习他的思想和基本用法

#include<cstdio>
    #include<cstring>
    #include<stack>
    #include<queue>
    #include<algorithm>
    using namespace std;
    char a[5],c[5];
    void que_ex(int t){
        int s;
        queue<int >que;
        for(int l=0;l<t;l++){
            scanf("%s",c);
            if(!strcmp(c,"IN")){
                scanf("%d",&s);
                que.push(s);
            }
            else if(!strcmp(c,"OUT")){
                if(!que.empty()){
                    printf("%d\n",que.front());
                    que.pop();
                }
                else
                printf("None\n");
            }
        }
    } 
    void sta_ex(int t){
        int s;
        stack<int >sta;
        for(int l=0;l<t;l++){
            scanf("%s",c);
            if(!strcmp(c,"IN")){
                scanf("%d",&s);
                sta.push(s);
            }
            else if(!strcmp(c,"OUT")){
                if(!sta.empty()){
                    printf("%d\n",sta.top());
                    sta.pop();
                }
                else
                printf("None\n");
            }
        }
    }
    int main(){
        int n;
        scanf("%d",&n);
        while(n--){
            int u;
            scanf("%d%s",&u,a);
            if(!strcmp(a,"FIFO"))
                que_ex(u);
            else if(!strcmp(a,"FILO"))
                sta_ex(u);
            }
        return 0;
    }

[http://acm.hdu.edu.cn/showproblem.php?pid=1702][http_acm.hdu.edu.cn_showproblem.php_pid_1702]

[20160801083947510]: /images/20220719/58268233f1454b3b95e7f1255cbaabea.png
[20160801083955604]: /images/20220719/200f617e27184462a05b9f12a0c4008a.png
[20160801084005089]: /images/20220719/566e98c9188e48588d4e49527fab8e51.png
[http_acm.hdu.edu.cn_showproblem.php_pid_1702]: http://acm.hdu.edu.cn/showproblem.php?pid=1702