HDU 1702 ACboy needs your help again!（栈和队列）

题目地址：​​点击打开链接​​

题意：简单栈和队列的模拟

思路：水题

AC代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>

using namespace std;

char a[10];

int main()
{
    int t,n,i,x,y;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%s",&n,a);
        if(strcmp(a,"FIFO") == 0)
        {
            queue<int> q;
            for(i=0; i<n; i++)
            {
                scanf("%s",a);
                if(strcmp(a,"IN") == 0)
                {
                    scanf("%d",&x);
                    q.push(x);
                }
                else
                {
                    if(q.empty())
                        printf("None\n");
                    else
                    {
                        y = q.front();
                        q.pop();
                        printf("%d\n",y);
                    }
                }
            }
        }
        else
        {
            stack<int> s;
            for(i=0; i<n; i++)
            {
                scanf("%s",a);
                if(strcmp(a,"IN") == 0)
                {
                    scanf("%d",&x);
                    s.push(x);
                }
                else
                {
                    if(s.empty())
                        printf("None\n");
                    else
                    {
                        y = s.top();
                        s.pop();
                        printf("%d\n",y);
                    }
                }
            }
        }
    }
    return 0;
}