poj 1363 Rails(栈)
2016-02-24 21:23
531 查看
Rails
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.
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
Sample Output
Source
Central Europe 1997
题意:给出火车出站的顺序,判断出站的顺序是否合理
如果1 2 3 进站,3出站,4 5进站,则出站顺序就是3 5 4 2 1
模拟栈,刚开始一直没弄懂题意,后来看了一下别人的题解
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 29411 | Accepted: 11477 |
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
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
Source
Central Europe 1997
题意:给出火车出站的顺序,判断出站的顺序是否合理
如果1 2 3 进站,3出站,4 5进站,则出站顺序就是3 5 4 2 1
模拟栈,刚开始一直没弄懂题意,后来看了一下别人的题解
#include<stdio.h> #include<string.h> #include<stack> #include<algorithm> using namespace std; int num[1100],n; int solve() { stack<int>s; int i,j=0,k; for(i=1;i<=n;i++) { if(num[j]==i) { j++; while(!s.empty()) { k=s.top(); s.pop(); if(k==num[j]) j++; else { s.push(k); break; } } } else s.push(i); } if(s.empty()) return 1; else return 0; } int main() { int i; while(scanf("%d",&n),n) { while(scanf("%d",&num[0]),num[0]) { for(i=1;i<n;i++) scanf("%d",&num[i]); if(solve()) printf("Yes\n"); else printf("No\n"); } printf("\n"); } return 0; }
相关文章推荐
- 【bzoj2434】[Noi2011]阿狸的打字机 AC自动机+fail树+dfs序+树状数组
- 欢迎使用CSDN-markdown编辑器
- How Does Caching Work in AFNetworking? : AFImageCache & NSUrlCache Explained
- 【bzoj3172】[Tjoi2013]单词 AC自动机+fail树
- leetcode笔记:Contains Duplicate II
- 模型选择准则之AIC和BIC
- AIDL
- STM32 Keil仿真进不了Main()函数
- leetcode笔记:Contains Duplicate
- if __name__ == '__main__':
- 如何解决failed to push some refs to git
- remove duplicated gene pair using awk
- bzoj 2434 [Noi2011]阿狸的打字机(fail树+离线处理+BIT)
- TIME_WAIT和CLOSE_WAIT
- Cornerstone的分支问题Merge dry run failed: working copy is too old
- RAID讲解
- 行为型模式11之4-Chain of Responsibility责任链模式例子理解
- org.hibernate.AssertionFailure: null id in com.base.program.entity.Program entry (don't flush the S
- Traits特性
- Your project contains errors, please fix them 。。。。