Discover the Web(栈,模拟)

题目
Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be reached by moving backward and forward. You are asked to implement this.

The commands are:
1.BACK: If the backward stack is empty, the command is ignored. Otherwise, push the current page on the top of the forward stack. Pop the page from the top of the backward stack, making it the new current page.

2.FORWARD: If the forward stack is empty, the command is ignored. Otherwise, push the current page on the top of the backward stack. Pop the page from the top of the forward stack, making it the new current page.

3.VISIT : Push the current page on the top of the backward stack, and make the URL specified the new current page. The forward stack is emptied.

4.QUIT: Quit the browser.

Input
Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains some commands. The keywords BACK, FORWARD, VISIT, and QUIT are all in uppercase. URLs have no whitespace and have at most 50 characters. The end of case is indicated by the QUIT command and it shouldn’t be processed. Each case contains at most 100 lines.

Output
For each case, print the case number first. For each command, print the URL of the current page (in a line) after the command is executed if the command is not ignored. Otherwise, print Ignored.

Sample Input
1
VISIT http://uva.onlinejudge.org/
VISIT http://topcoder.com/
BACK
BACK
BACK
FORWARD
VISIT http://acm.sgu.ru/
BACK
BACK
FORWARD
FORWARD
FORWARD
QUIT

Sample Output
Case 1:
http://uva.onlinejudge.org/
http://topcoder.com/
http://uva.onlinejudge.org/
http://www.lightoj.com/
Ignored
http://uva.onlinejudge.org/
http://acm.sgu.ru/
http://uva.onlinejudge.org/
http://www.lightoj.com/
http://uva.onlinejudge.org/
http://acm.sgu.ru/
Ignored

一道简单的模拟题，用两个栈即可，一个存网站，一个存前进网页。
只要一有后退操作，存网站的栈出栈，存前进网页的栈入栈即可。

注意，如果访问了网页,要把存前进网页的栈清空。

AC代码

#include <iostream>
#include <stack>
#include <string>
using namespace std;

int n,cnt;
stack<string>a,b;

int main()
{
    cin >> n;
    while(n--)
    {
        string tmp;
        a.push("http://www.lightoj.com/");
        cout << "Case " << ++cnt << ":" <<endl;
        while(cin >> tmp)
        {
            if(tmp[0] == 'V') //VISIT
            {
                string web;
                cin >> web;
                a.push(web);
                while(!b.empty()) b.pop();
                cout << web << endl;
            }
            else if(tmp[0] == 'B') //BACK
            {
                if(a.size() > 1)
                {
                    b.push(a.top());
                    a.pop();
                    cout << a.top() << endl;
                }
                else
                {
                    cout << "Ignored" << endl;
                }
            }
            else if(tmp[0] == 'F') //FORWARD
            {
                if(b.empty())
                {
                    cout << "Ignored" << endl;
                }
                else
                {
                    a.push(b.top());
                    b.pop();
                    cout << a.top() << endl;
                }
            }
            else if(tmp[0] == 'Q') //QUIT
            {
                while(!a.empty()) a.pop();
                while(!b.empty()) b.pop();
                break;
            }
        }

    }

    return 0;
}