AOJ-AHU-OJ-11 Rails

Rails

Time Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MB

 

Description

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.

 

Input

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.

 

Output

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.

 

Sample Input

Original

Transformed

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

 

Sample Output

Original

Transformed

Yes
No

Yes

 

Source

ZJGSU warmup

 

——————————————————————分割线——————————————————————

 

思路：栈模型！后进先出。模拟一个栈，（我是看白书学的）。开出数组sta[n+1]与tar[n+1]。sta表示栈。tar用来保存目标顺序（即所需的出车顺序），变量top始终记录栈顶元素下标。两个变量a, b，a表示当前列车号，b用作出栈记录，全部出栈时（b>n）循环结束。当前列车与当前出栈目标相符，则直接出栈，当前列车与当前出栈目标自加1 。当前不符，则分为三种情况：

情况1——当前列车与目标不符而恰好栈顶元素与目标相符，则栈顶元素立刻出栈。top自减，b自加。

情况2——栈顶元素不等于当前目标，则不能出栈，top自加，a进栈等待，a自加。

情况3——列车全部进栈完毕，a>n，出栈则不符合目标顺序，输出No

 

代码如下：

 1 #include <stdio.h>
 2 int main()
 3 {
 4     int n, flag = 0;
 5     while(scanf("%d", &n)!=EOF&&n)
 6     {
 7         int sta[n+1], tar[n+1];                   //该数组从下标 1开始 
 8         while(scanf("%d", tar + 1)!=EOF&&tar[1])
 9         {
10             int top = 0, i;                       //top始终是栈顶元素的下标 
11             int a = 1, b = 1;                     //a表示当前列车号，b用作出栈记录 
12             int ok = 1;
13             for(i = 2; i <= n; i++)
14               scanf("%d", tar + i);            
15             while(b <= n)                         
16             {
17                 if (a == tar[b]) 
18                     { a++; b++; }                 //与顺序相符，不必进栈，直接出栈 
19                 else if (top && sta[top] == tar[b]) 
20                     { top--; b++; }               //当前列车与目标不符，查看栈顶是否相符 
21                 else if (a <= n) 
22                     sta[++top] = a++;             //与顺序不符，进栈等待 
23                 else 
24                     { ok = 0; break; }            //全部进栈完毕，栈顶与目标不符，No 
25             }
26             printf("%s\n", ok ? "Yes" : "No");
27         }
28         printf("\n");
29     }
30     return 0;
31 }

  在学习了STL之后，你还可以这样写：

#include <cstdio>
#include <cstring>
#include <stack>
using namespace std;

const int MAXN = 1010;
int tar[MAXN];
int main(){
    int n, flag = 0;
    while(~scanf("%d", &n), n){
        while(~scanf("%d", tar + 1), tar[1]){
            int A = 1, B = 1;
            for(int i = 2; i <= n; i++)
                scanf("%d", tar + i);
            stack<int> sta;
            int ok = 1;
            while(B <= n){
                if(A == tar[B])
                    {A++; B++;}
                else if(!sta.empty() && sta.top() == tar[B])
                    {sta.pop(); B++;}
                else if(A <= n)
                    sta.push(A++);
                else
                    {ok = 0; break;}
            }
            printf("%s\n", ok ? "Yes" : "No");
        }
        puts("");
    }
    return 0;
}