POJ - 1028 Web Navigation

1.题面

http://poj.org/problem?id=1028

2.解题思路

用两个栈实现浏览器的的back，forward，visit三个功能，真的没什么好说的，你只要看懂了题目给出的三个功能的要求，然后把他翻译成代码就好了。除非不懂栈的概念，否则这应该是一道水题。

3.解题代码

/*****************************************************************
    > File Name: tmp.cpp
    > Author: Uncle_Sugar
    > Mail: uncle_sugar@qq.com
    > Created Time: 2016年02月24日 星期三 10时34分49秒
 ****************************************************************/
# include <cstdio>
# include <cstring>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;

const int debug = 1;
const int size  = 5000 + 10; 
typedef long long ll;

stack<string> back_stk,forw_stk;
string cur_page = "http://www.acm.org/";
void Back(){
	if (!back_stk.empty()){
		forw_stk.push(cur_page);
		cur_page = back_stk.top();
		back_stk.pop();
		cout << cur_page << '\n';
	}else {
		cout << "Ignored" << '\n';
	}
}
void Forward(){
	if (!forw_stk.empty()){
		back_stk.push(cur_page);
		cur_page = forw_stk.top();
		forw_stk.pop();
		cout << cur_page << '\n';
	}else {
		cout << "Ignored" << '\n';
	}
}
void Visit(){
	back_stk.push(cur_page);
	cin >> cur_page;
	while (!forw_stk.empty())
		forw_stk.pop();
	cout << cur_page << '\n';
}
char cmd[size];
int main()
{
	std::ios::sync_with_stdio(false);cin.tie(0);
	int i,j,k;
	while (!back_stk.empty())	back_stk.pop();
	while (!forw_stk.empty())	back_stk.pop();
	while (cin >> cmd && cmd[0]!='Q'){
		switch(cmd[0]){
			case 'B':Back();break;
			case 'F':Forward();break;
			case 'V':Visit();break;
		}
	}
	return 0;
}