題目：詳見uva514.

此題就是輸入1~n的任意一種順序組合，問能否通過1,2,3,……n轉(zhuǎn)換為此組合。
此題的C鐵軌其實就是棧，特點是后進(jìn)先出，通過棧能夠改變數(shù)字的順序。

參考代碼：

#include <iostream>
#include <cstring>
#include <stack>
using namespace std;
int rail[1005];
void yesandno(int rail[],int n) {
    stack<int> s;
    int flag = 1;
    int a = 1,b = 1;
    while (b <= n) {
        if (a == rail[b]) {
            a++;
            b++;
        }
        else if (!s.empty() && s.top() == rail[b]) {
            s.pop();
            b++;
        }
        else if (a <= n) {
            s.push(a++);
        }       
        else {
            flag = 0;
            break;
        }
    }
    if (flag == 1) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}
int main() {
    int n;
    while (cin >> n && n) {
        for (int i = 1;i <= n;++i) {
            cin >> rail[i];
            if (rail[i] == 0) {
                cout << endl;
                break;
            }
            if (i == n) {
                yesandno(rail,n);
                i = 0;
                memset(rail,0,sizeof(rail));
            }
        }
    }
    return 0;
}