Rails-数据结构与堆栈模拟

题目来源：ACM Central Europe 1997，UVA514

题目详情

题目背景

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≤1000N≤1000 coaches numbered in increasing order 1,2,…,N1,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,…,aNa1,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 NN described above. In each of the next lines of the block there is a permutation of 1,2,…,N1,2,…,N. The last line of the block contains just 0.
The last block consists of just one line containing 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. 

输入：

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

输出：

Yes
No

Yes

题目解释

 从A出进火车，编号从1~n依次进入，先进后出。现在给出火车出战的顺序，判断这个顺序是否合法。

题目分析

这是一个堆栈的模拟问题，将火车站看作一个栈（先进后出），设一个t记录火车已经进到几号了，如果出战的车的编号比进去的火车的编号大，那么就将火车从t开始加到这个编号，在让这个编号出栈，如果这个编号比进的或者的最大编号小，看一下栈首是不是该编号，如果是则出栈，否则的话就是不满足。

关于栈的相关问题，大家可以去看一下笔者的STL容器的总结

STL容器_程序的搬运工Hunter的博客-CSDN博客

AC代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1100;
int a[N];
int main()
{
    int n;
    while(scanf("%d",&n))//火车的数量
    {
        if(n == 0)//结束标记
            return 0;
        while(1)
        {
            stack<int>s;//定义一个栈，这样每次都是新栈。
            cin >> a[0];
            if(a[0] == 0)
                break;
            for(int i = 1;i < n;i++)
                scanf("%d",&a[i]);
            int t=1;
            int flag = 1;
            for(int i = 0;i < n;i++)
            {
                if(a[i]>=t)//如果火车还没进到这，就从t开始进到a[i]；
                {
                    for(int j = t;j <= a[i];j++)
                    {
                        s.push(j);//入栈
                    }
                    //cout << s.top() << " ";
                    s.pop();//将a[i]出栈
                    t = a[i] + 1;
                }
                else if(s.top() == a[i])//栈首满足，弹出后继续
                {
                    //cout << s.top() << endl;
                    s.pop();

                }
                else//栈首不满足，结束
                {
                    flag = 0;
                    break;
                }
            }
            if(!flag)
                cout << "No" << endl;
            else
                cout << "Yes" << endl;
        }
        cout << endl;
    }
}