POJ - 1028(c++)

题目：

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/

不懂意思的就去百度查翻译

知识点：1、栈

我的代码：

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

int main(){
	stack<string>qz,hz;			//声明对象。前进栈、后退栈
	string cp="http://www.acm.org/",com;	//cp是当前网页，com是输入的
	while(cin>>com){
		if(com[0]=='B')			//BACK
		{
			if(hz.empty())		//后退栈空返回true 否则false
			{
				cout<<"Ignored"<<endl;	//后退栈空，被忽略，输出Ignored
			}
			else
			{
				qz.push(cp);	//将当前网页置于前进栈的栈顶
                cp=hz.top();	//当前网页等于后退栈的栈顶
                hz.pop();		//移除后退栈的栈顶
                cout<<cp<<endl;	//输出当前网页，也就是之前的前一个网页
			}
		}
		else if(com[0]=='F')	//FORWARD
		{
			if(qz.empty()){		//前进栈空为ture,
				cout<<"Ignored"<<endl;
			}
			else
			{
				hz.push(cp);	//将当前网页置于后退栈的顶部
				cp=qz.top();	//将当前网页等于前进栈的顶部
				qz.pop();		//移除前进栈的顶部
				cout<<cp<<endl;	//表达出当前网页
			}
			
		}
		else if(com[0]=='V')	//VISIT
        {
			hz.push(cp);		//将当前网页置于后退栈的栈顶
			cin>>cp;			//输入新网站
			cout<<cp<<endl;		//进入新网站
			while(!qz.empty())	//前进栈空返回false，否则true,直到清空前进栈
				qz.pop();		//移除前进栈栈顶元素			
		}
		else
		{
			break;				//都不是则跳出循环
		}
	}
	return 0;
}