uva 514Rails

原题：
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 a 1 .a 2 ,…,a N . 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
中文：
先给你一个数，然后给你n个数，问你这n个数和1到n按照顺序排序能否形成一个栈。（坑）

#include <bits/stdc++.h>using namespace std;stack<int> S;vector<int> I,O;void ini(){    I.clear();    O.clear();    while(!S.empty())        S.pop();    S.push(-1);}int main(){    ios::sync_with_stdio(false);    int n,x;    while(cin>>n,n)    {        while(cin>>x,x)        {            ini();            O.push_back(x);            int flag=true;            for(int i=1;i<=n;i++)                I.push_back(i);            for(int i=2;i<=n;i++)            {                cin>>x;                O.push_back(x);            }            int j=0,k=0;            while(true)            {                if(k==n)                    break;                if(I[j]==O[k])                {                    j++;k++;                    continue;                }                if(O[k]==S.top())                {                    k++;                    S.pop();                    continue;                }                if(j<n)                {                    S.push(I[j]);                    j++;                }                else                {                    flag=false;                    break;                }            }            if(flag)                cout<<"Yes"<<endl;            else                cout<<"No"<<endl;        }        cout<<endl;    }    return 0;}

解答：
找个简单题练练手，结果这题我改了将近2个多小时，无论怎么改第一组数据都过不了，还以为自己渣到连栈都不会。结果发现题读错了=_=。注意不是先输入一个n，然后输入两行数据，而是输入一行数据！默认出栈的顺序就是1到n编号，还有，不是输入一个0表示结束，而是输入一个0表示换一个n，连续输入两个0才是结束。。晕