hdu1702 list or stack+queue

來源:互聯網
上載者:User

http://acm.hdu.edu.cn/showproblem.php?pid=1702

#include<iostream>#include<cstdio>#include<cstring>#include<list>using namespace std;int main(){   // freopen("1.txt","r",stdin);    int n;    scanf("%d",&n);    while(n--)    {        int m,i,x;        list<int>li;        li.clear();        char s[10],ss[10];        scanf("%d %s",&m,s);        if(strcmp(s,"FIFO")==0)        {            for(i=0; i<m; i++)            {                scanf("%s",ss);                if(strcmp(ss,"IN")==0)                {                    cin>>x;                    li.push_back(x);                }                else                {                    if(li.empty())                        cout<<"None"<<endl;                    else                    {                        cout<<li.front()<<endl;                        li.pop_front();                    }                }            }        }        else        {            for(i=0; i<m; i++)            {                scanf("%s",ss);                if(strcmp(ss,"IN")==0)                {                    cin>>x;                    li.push_back(x);                }                else                {                    if(li.empty())                        cout<<"None"<<endl;                    else                    {                        cout<<li.back()<<endl;                        li.pop_back();                    }                }            }        }    }    return 0;}

  

#include<iostream>#include<cstdio>#include<cstring>#include<stack>#include<queue>using namespace std;int main(){   // freopen("1.txt","r",stdin);    int n,x,m;    char s[10],ss[10];    stack<int>st;    queue<int>q;    scanf("%d",&n);    while(n--)    {        while(!st.empty())            st.pop();        while(!q.empty())            q.pop();        scanf("%d %s",&m,s);        if(strcmp(s,"FILO")==0)        {            for(int i=0; i<m; i++)            {                scanf("%s",ss);                if(strcmp(ss,"IN")==0)                {                    cin>>x;                    st.push(x);                }                else                {                    if(st.empty())                        cout<<"None"<<endl;                    else                    {                        cout<<st.top()<<endl;;                        st.pop();                    }                }            }        }        else        {            for(int i=0; i<m; i++)            {                scanf("%s",ss);                if(strcmp(ss,"IN")==0)                {                    cin>>x;                    q.push(x);                }                else                {                    if(q.empty())                        cout<<"None"<<endl;                    else                    {                        cout<<q.front()<<endl;                        q.pop();                    }                }            }        }    }    return 0;}

  

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.