FZU 2091 播放器（栈应用）

栈基础应用

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<stack>
using namespace std;
int main()
{
    int t,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        stack<int>s;
        while(!s.empty()) s.pop();
        s.push(1);
        char op[20];
        int num;
        while(m--)
        {
            scanf("%s",op);
            if(!strcmp(op,"PRE"))
            {
                if(s.size() == 1)
                {
                    printf("%d\n",s.top());
                }
                else
                {
                    s.pop();
                    printf("%d\n",s.top());
                }
            }
            else if(!strcmp(op,"NEXT"))
            {
                int now = s.top() + 1;
                if(now > n) now = n;
                printf("%d\n",now);
                if(s.empty())
                {
                    s.push(now);
                }
                else if(s.top() != now)
                {
                    s.push(now);
                }
            }
            else
            {
                int now;
                scanf("%d",&now);
                printf("%d\n",now);
                if(s.empty())
                {
                    s.push(now);
                }
                else if(s.top() != now)
                {
                    s.push(now);
                }
            }
        }
    }
}

 

转载于:https://www.cnblogs.com/jifahu/p/5447445.html