poj1363Rails(栈)
来源:互联网 发布:十大排序算法复杂度 编辑:程序博客网 时间:2024/05/21 10:21
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.
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.
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
51 2 3 4 55 4 1 2 3066 5 4 3 2 100
Sample Output
YesNoYes
题意:给一个1->n的进栈的顺序序列,然后给一个出栈的序列,问这个出栈的顺序序列可不可能存在。标号为1->n的车厢可以按顺序分离,例如第一个例子,1进栈->1出栈,2进栈->2出栈....所以 5 4 3 2 1的出栈顺序是存在的。
代码如下;
#include<stdio.h>#include<string.h>#include<stack>#include<algorithm>using namespace std;int main(){int q[1100],n;while(scanf("%d",&n),n){stack<int>st;while(scanf("%d",&q[1]),q[1]){int i ;for(i=2;i<=n;i++)scanf("%d",&q[i]);int l=1;for(i=1;i<=n;i++){st.push(i);while(!st.empty()&&q[l]==st.top()){st.pop();l++;}}if(l==n+1)printf("Yes\n");elseprintf("No\n");memset(q,0,sizeof(q));}printf("\n");}}
0 0
- poj1363Rails(栈)
- poj1363Rails(栈模拟)
- poj1363Rails
- poj1363Rails
- poj1363Rails
- POJ1363Rails
- 数据结构-栈(线性栈)
- 栈(二):顺序栈
- 栈(三):链式栈
- 栈和队列(栈)
- 栈(Stack)
- 栈(C语言)
- 栈(纪念版)
- c++迷宫(栈)
- zoj1259Rails(栈)
- Hdu1022(栈)
- 栈(1)
- poj3159(spfa+栈)
- python open(文件内建函数)
- c#基础入门(1)——变量、运算符、数组
- 配置GitLab 用smtp发邮件 (gitlab-6.7.3)
- Logistic回归与梯度下降法
- Leetcode 153. Find Minimum in Rotated Sorted Array (Medium) (cpp)
- poj1363Rails(栈)
- ubuntu14.04有线网配置(用于和嵌入式板子网络通讯)
- web学习
- 最简单的视音频播放示例9:SDL2播放PCM
- 走遍欧洲 —— 德国
- 复杂的整数划分问题(dp)
- LeetCode进阶之路(Merge k Sorted Lists)
- Mongoose 移除unique的限制
- 【一天一道LeetCode】#257. Binary Tree Paths