POJ_1028

感觉是道基础题， 开始用栈实现的， 纠结了一阵子， 后来参考了网上的思路， 晕死...

 

#include <iostream>#include <string>using namespace std;const int MAX_NUM = 200;int main(){string command;string webSites[MAX_NUM] = {"http://www.acm.org/"};int curIndex = 0;int webCount = 1;int back[MAX_NUM];int forward[MAX_NUM];int backIndex = 0, forwardIndex = 0;while(cin>>command && command != "QUIT"){if(command == "VISIT"){cin>>webSites[webCount];back[backIndex++] = curIndex;curIndex = webCount;forwardIndex = 0;cout<<webSites[webCount++]<<endl;}else if(command == "BACK"){if(backIndex == 0)cout<<"Ignored"<<endl;else{forward[forwardIndex++] = curIndex;curIndex = back[--backIndex];cout<<webSites[curIndex]<<endl;}}else if(command == "FORWARD"){if(forwardIndex == 0)cout<<"Ignored"<<endl;else{back[backIndex++] = curIndex;curIndex = forward[--forwardIndex];cout<<webSites[curIndex]<<endl;}}}return 0;}