hdu 1702 ACboy needs your help again!

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1702

题目大意：按照所给要求，输出相应的数。“FIFO”指代先进先出，即队列的概念，“FILO”指代先进后出，即栈的表现形式~这里定义两个函数即可，一个队列，一个栈的调用！

#include <iostream>
#include <cstdio>
#include <queue>
#include <stack>
#include <cstring>
using namespace std;

int s,p,o,z,q;
char ch[105],str[105];

int FIFO(int w)
{
    queue<int>q,qq;
    for (int i=0; i<w; i++)
    {
        scanf("%s",ch);
        if (strcmp(ch,"IN")==0)
        {
            scanf("%d",&o);
            q.push(o);
        }
        else if (strcmp(ch,"OUT")==0)
        {
            if (!q.empty())
            {
                s=q.front();
                cout<<s<<endl;
                q.pop();
            }
            else
                cout<<"None"<<endl;

        }
    }
}
int FILO(int w)
{
    stack<int>q,qq;
    for (int i=0; i<w; i++)
    {
        scanf("%s",ch);
        if (strcmp(ch,"IN")==0)
        {
            scanf("%d",&p);
            q.push(p);
        }
        else if (strcmp(ch,"OUT")==0)
        {
            if (!q.empty())
            {
                z=q.top();
                cout<<z<<endl;
                q.pop();
            }
            else
                cout<<"None"<<endl;
        }
    }
}
int main ()
{
    int n,m;
    while (cin>>n)
    {
        while (n--)
        {
            scanf ("%d%s",&m,str);
            //scanf("%s %d",ch,m);
            if (strcmp(str,"FIFO")==0)
                FIFO(m);
            else
                FILO(m);
        }
    }
    return 0;
}