poj1028-Web Navigation(水题)
来源:互联网 发布:攻壳模动队淘宝 编辑:程序博客网 时间:2024/05/18 02:08
Web Navigation
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29450 Accepted: 13160
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/BACKBACKBACKFORWARDVISIT http://www.ibm.com/BACKBACKFORWARDFORWARDFORWARDQUIT
Sample Output
http://acm.ashland.edu/http://acm.baylor.edu/acmicpc/http://acm.ashland.edu/http://www.acm.org/Ignoredhttp://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
虽然是水题,,但是。。wa几次。。哭死。。没注意一句话
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.
要把后面的去掉
#include<iostream>#include<string>#include<vector>#include<algorithm>using namespace std;int main(){string left,right;vector<string> all(105);int k,r;k=r=0;all[k++]="http://www.acm.org/";while(cin>>left){if(left=="VISIT"){cin>>right;all[k++]=right;cout<<right<<endl;for(int i=k;i<all.size();i++)all[i]="";}else if(left=="BACK"){k--;if((k-1)<0) {cout<<"Ignored"<<endl;k=1;}else{right=all[k-1];cout<<right<<endl;}}else if(left=="FORWARD"){k++;right=all[k-1];if(right.size()<=0){cout<<"Ignored"<<endl;k--;}elsecout<<right<<endl;}else{if(left=="QUIT")break;}}return 0;}
0 0
- poj1028-Web Navigation(水题)
- poj1028 Web Navigation
- poj1028--Web Navigation
- <poj1028> Web Navigation
- POJ1028 Web Navigation
- 【poj1028】Web Navigation
- poj1028 Web Navigation
- POJ1028-Web Navigation-栈
- POJ1028——Web Navigation
- POJ1028 Web Navigation【堆栈+模拟】
- POJ1028
- POJ1028
- poj1028
- poj1028
- POJ1028
- poj1028
- Web Navigation
- Web Navigation
- hdu 4866 主席树
- 常量指针和指针常量
- poj3321
- 黑马程序员--IO流之PrintStream:打印流
- 啊实打实的撒的啊实打实的
- poj1028-Web Navigation(水题)
- Win32API、MFC、.NET多线程并行求矩阵乘法(星星笔记)
- 按时可达上课了大事了的撒了解
- POJ 1815 (最小割的点集)
- 黑马程序员--IO流之其他
- 获取父类的泛型类型
- 求字符串中出现次数最多的字符及其出现次数
- 9-操作符重载
- hdu1080