POJ 1028

题目：题目链接

题目的意思就是实现网址的visit,back,forward,并且基址是“http://www.acm.org/”。这样就用类似于stack的数组就能实现了：

#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
using namespace std;

#define size 100
string forward[size+1];
string backward[size+1];
int f_pos = 1;
int b_pos = 1;

int main()
{
    string current = "http://www.acm.org/";
    while(1)
    {
        string command, url;
        cin >> command;
        if(command == "QUIT")
            break;
        if(command == "VISIT")
        {
            cin >> url;
            f_pos = 1;//哦，对了，只要你当前visit了，那么此时就不能forward了。
            backward[b_pos++] = current;
            current = url;
            cout << current << endl;
            continue;
        }
        if(command == "BACK")
        {
            if(b_pos == 1)
                cout << "Ignored" <<endl;
            else
            {
                forward[f_pos++] = current;
                current = backward[b_pos-1];
                cout << backward[--b_pos] <<endl;
            }
            continue;
        }
        if(command == "FORWARD")
        {
            if(f_pos == 1)
                cout << "Ignored" <<endl;
            else
            {
                backward[b_pos++] = current;
                cout << forward[--f_pos] << endl;
                     current = forward[f_pos];
            }
            continue;
        }
    }
    return 0;
}

这里就直接用到了string，这样就直接可以进行字符串的比较了，当初写的时候就是这个网址的存储比较纠结。现在用两个string数组就搞定了。

努力努力...