首页 > 代码库 > poj 1028 Web Navigation(模拟题)
poj 1028 Web Navigation(模拟题)
题目链接:http://poj.org/problem?id=1028
Description
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/
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
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.
Output
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.
Sample Input
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
Sample Output
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
Source
East Central North America 2001
题意:
模拟浏览器浏览网页是前后翻页!
思路:
开两个栈,分别存储当前网页前后的网页,注意新访问一个网页时,应该把当前网页的前面的栈清空!
代码如下:
#include <iostream> #include <algorithm> #include <string> #include <stack> using namespace std; stack <string>b; stack <string>f; int main() { string tt = "http://www.acm.org/"; string s; while(cin >> s) { if(s == "QUIT") break; if(s == "VISIT") { b.push(tt); cin >> tt; cout<<tt<<endl;//始终输出当前页 while(!f.empty())//当新访问一个页面的时候把之前页面前面的清空 { f.pop(); } } else if(s == "BACK") { if(!b.empty()) { f.push(tt); tt = b.top(); b.pop(); cout<<tt<<endl;//始终输出当前页 } else cout<<"Ignored"<<endl; } else { if(!f.empty()) { b.push(tt); tt = f.top(); f.pop(); cout<<tt<<endl;//始终输出当前页 } else cout<<"Ignored"<<endl; } } return 0; }
poj 1028 Web Navigation(模拟题)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。