noip模拟赛 希望

分析：题目中说用栈实现，我觉得这样很麻烦，就用了一个数组+指针解决了.其实就是大模拟.

#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

string s, ss;
stack <string> s1, s2;
string q[];
int cnt = , maxx = ;

int main()
{
    q[] = "http://www.acm.org/";
    while (cin >> s && s != "QUIT")
    {
        if (s == "VISIT")
        {
            cin >> ss;
            q[++cnt] = ss;
            maxx = cnt;
            cout << ss << endl;
        }
        else
            if (s == "BACK")
            {
            if (cnt -  <= )
                printf("Ignored\n");
            else
            {
                cnt--;
                cout << q[cnt] << endl;
            }
            }
            else
            {
                if (cnt +  > maxx)
                    printf("Ignored\n");
                else
                {
                    cnt++;
                    cout << q[cnt] << endl;
                }
            }
    }
return ;
}