原题:
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 file 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 file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains ‘Yes’ if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it contains ‘No’. In addition, there is one empty line after the lines corresponding to one block of the input file. There is no line in the output file corresponding to the last “null” block of the input file.
Sample Input
5
1 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0
Sample Output
Yes
No
Yes
解法1:
第一次用栈来解决问题,还不是很熟悉
1 #include <iostream>
2 #include <stdio.h>
3 #include <stack>
4
5 using namespace std;
6
7 const int MAX = 1000 + 199;
8
9 int main()
10 {
11 stack< int > b;
12 int a[MAX];
13 int n;
14 int temp = 1;
15
16 while( cin>>n )
17 {
18
19 if(n == 0) break;
20 else
21 {
22 while(cin>>a[0])
23 {
24 temp = 1;
25 if(a[0] == 0) break;
26 for(int i = 1;i < n;i++)
27 cin>>a[i];
28 int A = 1,B = 0;
29 while(B < n)
30 {
31 if( A == a[B]) { A++ ; B++;}
32 else if( !b.empty()&&b.top() == a[B]) { b.pop();B++;}
33 else if( A <= n) { b.push(A++);}
34 else { temp = 0;break;}
35 }
36 if(temp == 0) cout<<"No"<<endl;
37 else cout<<"Yes"<<endl;
38 }
39 }
40 cout<<endl;
41 }
42
43 return 0;
44 }