POJ - 1363 - Rails(栈)
2015-08-03 11:28
399 查看
POJ 1363.Rails
Time Limit: 1000MS Memory Limit: 10000KDescription
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
51 2 3 4 5
5 4 1 2 3
0
6
6 5 4 3 2 1
0
0
Sample Output
YesNo
Yes
题意:让n个数进栈,看能否按给的数字序列出栈
[code]#include<cstdio> #include<cstring> #include<algorithm> #include<stack> using namespace std; stack<int>s; int main() { int n, t[1005]; while(scanf("%d", &n)!=EOF && n){ while(1){ scanf("%d", &t[0]); if(!t[0]){ printf("\n"); break; } for(int i = 1; i < n; i++) scanf("%d", &t[i]); int flag = 1, num = 1; for(int i = 0; i < n;){ if(num == t[i]){ //如果数字相同,不用进栈,直接判断下一个 i++, num++; } else if(!s.empty() && s.top()==t[i]){ //如果栈不为空,且栈头和给定的数相同 i++; s.pop(); } else if(num <= n){ //若上述都不符合,则让数字进栈 s.push(num); num++; } else{ flag = 0; break; } } if(flag) printf("Yes\n"); else printf("No\n"); while(!s.empty()) s.pop(); } } return 0; }
相关文章推荐
- 用CorePlot实现类似Air Quality的柱状图滚动效果(1/2)
- HDU 2476 区间DP String painter
- POJ 1273 --Drainage Ditches【最大流模板 && dinic】
- openstack keypair实践
- DllMain和多线程死锁
- MacBook Air响一声白屏故障情况说明及解决
- Failed to start monitoring XXXXX\web.config because access was denied
- 解决nginx: [error] open() "/usr/local/nginx/logs/nginx.pid" failed错误
- (FFOS Gecko & Gaia) IPC - 一种“猥琐的”IPC方式
- NSURLSession的代理为什么使用retain?
- OpenSCManager failed - 拒绝访问
- Windows环境下main()函数传入参数
- 杭电oj1789 Doing Homework again(贪心与队列完美碰撞)
- [2015hdu多校联赛补题]hdu5293 Tree chain problem
- Check GitLab API access: FAILED: Failed to connect to internal API
- public static void main(String arg[]) 详细解释
- bower failed: UNABLE_TO_VERIFY_LEAF_SIGNATURE
- 70. Climbing Stairs
- repair windows ntfs part on ubuntu
- 《MFC游戏开发》笔记九 游戏中的碰撞判定初步&怪物运动简单AI