-
时间限制:
- 1000ms 内存限制:
- 65536kB
-
描述
-
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. In this problem, you
are asked to implement this.
The following commands need to be supported:
BACK: 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. If the backward stack is empty, the command is ignored.
FORWARD: 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. If the forward stack is empty, the command is ignored.
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.
QUIT: Quit the browser.
Assume that the browser initially loads the web page at the URL http://www.acm.org/
输入 - Input is a sequence of commands. The command keywords BACK, FORWARD, VISIT, and QUIT are all in uppercase. URLs have no whitespace and have at most 70 characters. You may assume that no problem instance requires more than 100 elements in each stack at any time. The end of input is indicated by the QUIT command. 输出
- For each command other than QUIT, print the URL of the current page after the command is executed if the command is not ignored. Otherwise, print "Ignored". The output for each command should be printed on its own line. No output is produced for the QUIT command. 样例输入
-
VISIT http://acm.ashland.edu/ VISIT http://acm.baylor.edu/acmicpc/ BACK
BACK
BACK FORWARD VISIT http://www.ibm.com/ BACK BACK FORWARD FORWARD FORWARD QUIT样例输出
http://acm.ashland.edu/
http://acm.baylor.edu/acmicpc/
http://acm.ashland.edu/
http://www.acm.org/
Ignored
http://acm.ashland.edu/
http://www.ibm.com/
http://acm.ashland.edu/
http://www.acm.org/
http://acm.ashland.edu/
http://www.ibm.com/
Ignored
- #include<iostream>
- #include<string>
- #include<stack>
- using namespace std;
- #define ACM "http://www.acm.org/"
- int main()
- {
- stack<string> Forward;
- stack<string> Backward;
- string str;
- Backward.push(ACM);
- while(cin>>str)
- {
- if(str == "QUIT")break;
- if(str == "VISIT")
- {
- cin>>str;
- cout<<str<<endl;
- Backward.push(str);
- while(!Forward.empty())Forward.pop();
- }
- if(str == "BACK")
- {
- if(Backward.size()>1)
- {
- Forward.push(Backward.top());
- Backward.pop();
- cout<<Backward.top()<<endl;
- }
- else
- {
- cout<<"Ignored"<<endl;
- }
- }
- if(str == "FORWARD")
- {
- if(!Forward.empty())
- {
- cout<<Forward.top()<<endl;
- Backward.push(Forward.top());
- Forward.pop();
- }
- else
- {
- cout<<"Ignored"<<endl;
- }
- }
- }
- return 0;
- }
- #include<iostream>
本文详细阐述了如何通过使用两个栈来实现浏览器的基本功能,包括后退、前进、访问新页面和退出。通过一系列的命令操作,展示了如何管理浏览器历史记录。
47

被折叠的 条评论
为什么被折叠?



