Rails(栈和队列简单应用)
来源:互联网 发布:高级网络管理 编辑:程序博客网 时间:2024/05/17 21:50
Rails
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31465 Accepted: 12235
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
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<map>#include<math.h>#include<iostream>#include<algorithm>#include<stack>#include<queue>using namespace std;int main(){int t,c[100001],flag = 0,f = 0;stack<int> q;cin>>t;while(1){if(flag == 1)break;for(int i = 1; i <= t; i++){cin>>c[i];if(c[i] == 0){f = 1;printf("\n");cin>>t;if(t == 0)flag = 1;break;}}for( int i = 1,j = 1; j <= t; j++){q.push(j);while(!q.empty() && c[i]==q.top()){q.pop(); i++;}}if(!q.empty()&&f == 0)printf("No\n");if(q.empty()&&f == 0)printf("Yes\n");f = 0;while(!q.empty())q.pop();for(int i = 1; i <= t; i++)c[i] = 0;}return 0;}//POJ1363 火车轨道题
0 0
- Rails(栈和队列简单应用)
- rails 消息队列应用
- 栈和队列的简单应用
- 栈和队列的简单应用
- hdu 1702 栈和队列的简单应用
- c++的STL中栈和队列的简单应用
- 栈和队列应用
- hdu1702ACboy needs your help again!(栈和队列的简单应用)
- ACboy needs your help again!(栈和队列简单应用)
- 栈和队列的应用
- Rails(poj 1363 栈的应用)
- Uva 514 Rails(栈应用)
- POJ:1702 Rails(栈的应用)
- 队列和栈简单实现
- 队列的简单应用
- Uva 514 Rails(简单栈)
- notify和wait在消息队列中的简单应用
- 队列的简单应用-杨辉三角和约瑟夫环
- 蓝桥杯Anagrams问题题解
- Wireshark入门与进阶系列一之基本使用
- 国内外blog
- Hive1.2.1安装
- Online Judge编程注意事项整理
- Rails(栈和队列简单应用)
- jQuery 绑定 select 联动 手动触发
- java 内存模型(JMM)简介
- 白天夜间模式切换
- Android多线程断点下载器
- HSQLDB常用命令
- 高性能网站建设的14个原则
- Android基本问题汇总
- Codeforces 103A Testing Pants for Sadness