TJU OJ 1201 Rails

题目描述

There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish only a surface track. Moreover, it turned out that the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track.

The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. Assume that the train arriving from the direction A has N <= 1000 coaches numbered in increasing order 1, 2, …, N. The chief for train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be a1, a2, …, aN. Help him and write a program that decides whether it is possible to get the required order of coaches. You can assume that single coaches can be disconnected from the train before they enter the station and that they can move themselves until they are on the track in the direction B. You can also suppose that at any time there can be located as many coaches as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station.

输入

The input consists of blocks of lines. Each block except the last describes one train and possibly more requirements for its reorganization. In the first line of the block there is the integer N described above. In each of the next lines of the block there is a permutation of 1, 2, …, N. The last line of the block contains just 0.

The last block consists of just one line containing 0.

5
1 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0

输出

The output contains the lines corresponding to the lines with permutations in the input. A line of the output contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input. Otherwise it contains No. In addition, there is one empty line after the lines corresponding to one block of the input. There is no line in the output corresponding to the last ``null’’ block of the input.

Yes
No

Yes

解决思路

• 题目大意是A边有编号为1-N递增的N个车厢，给出一个序列B，当A的所有车厢到B时车厢重新排列后能否构成B序列。
• 显然AB之间是一个栈，通过这个栈产生不同的序列。
• 首先从头扫描B序列的首元素。
• 看一下栈顶元素是否为这个元素，是的话从栈中弹出这个元素，然后扫描B序列的下一个元素。
• 不是的话扫描A队列(A可以看作一个队列)的头元素，如果A的首元素和该元素相等，从A序列中删除头元素，然后扫描B序列的下一个元素。
• 如果A的首元素和该元素不相等，那么就把A的首元素入栈。直到找到A的头元素和B序列正在扫描的元素相等为止。
• 如果栈顶元素和A序列的所有元素都不等于正在扫描的B序列的元素那么B序列就无法生成。

C++代码

#include <iostream>
#include <stack>
using namespace std;

int main(){
    int numCoaches; // 车厢数量
    int InitCoaches[1005], LastCoaches[1005]; // 初始的车厢排列顺序，最后的车厢排列顺序
    stack <int> s; // 模拟Station
    while (cin >> numCoaches && numCoaches) {
        int number; // 第一个车厢号码
        while(cin >> number && number){
            LastCoaches[0] = number;
            InitCoaches[0] = 1;
            for(int i = 1; i < numCoaches; i++){
                cin >> LastCoaches[i];
                InitCoaches[i] = i + 1;
            }

            int curLast = 0, curInit = 0;
            bool flag;
            for(int i = 0; i < numCoaches; i++){
                flag = false;
    
                if(s.empty() || s.top() != LastCoaches[i]){ // 判断生成序列的头元素是否等于初始序列的头元素
                    for(int j = curInit; j < numCoaches; j++){
                        if(InitCoaches[curInit] == LastCoaches[i]){
                            flag = true;
                            curInit++;
                            break;
                        }
                        s.push(InitCoaches[curInit++]);
                    }
                }
                else{
                    if(!s.empty() && s.top() == LastCoaches[i]){ // 判断生成序列的头元素是否等于栈顶元素
                        flag = true;
                        s.pop();
                    }                    
                }
                if(!flag){
                    cout << "No" << endl;
                    break;
                }
            }
            if(flag == true){
                cout << "Yes" << endl;
            }
            
        }
        cout << endl;
    }
    return 0;
}