poj-1363-Rails(栈)
来源:互联网 发布:如何部署阿里云服务器 编辑:程序博客网 时间:2024/05/01 11:47
Rails
Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 21724Accepted: 8700
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
Source
Central Europe 1997
import java.util.Arrays;import java.util.Scanner;import java.util.Stack;public class hdu_1363_Rails_201308121938 {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stub Scanner sc =new Scanner (System.in); Stack<Integer> st = new Stack<Integer>(); while(true){//11969046 1983210400 1363 Accepted 6712K 1063MS Java 1823B 2013-08-12 21:46:05 int N =sc.nextInt(); if(N==0)break; int []s = new int [N+10]; while(true){ s[1]=sc.nextInt(); if(s[1]==0)break; boolean []vis =new boolean [N+10];//标记已经查看过的数 Arrays.fill(vis, false); for(int i=2 ; i<= N; i++) s[i]=sc.nextInt(); for(int i=1; i<s[1]; i++)//自身不进栈 st.push(i); vis[s[1]]=true; boolean flag = false; for(int i=2; i<= N; i++){ vis[s[i]]=true; if(s[i]<s[i-1]){ if(st.peek()!=s[i]){ System.out.println("No"); flag=true; break; } else{ st.pop(); continue; } } else if(s[i]>s[i-1]){ for(int j=s[i-1]+1;j<s[i];j++){ if(!vis[j]){ st.push(j); } } } } if(flag==false){ System.out.println("Yes"); } } System.out.println(); } }}
- poj-1363-Rails(栈)
- poj 1363 Rails 【栈】
- POJ - 1363 - Rails(栈)
- poj 1363 Rails 【栈】
- POJ-1363 Rails (栈)
- POJ 1363Rails (栈)
- POJ 1363 Rails ( 栈
- POJ 1363|Rails|栈
- Poj-1363-Rails-栈
- POJ 1363-Rails 简单栈
- POJ 1363 Rails 模拟栈
- POJ 1363 Rails(模拟栈)
- poj 1363 Rails(栈)
- POJ 1363 Rails(栈)
- poj 1363 Rails(栈)
- 【POJ】1363 - Rails(栈)
- 【Poj】-1363-Rails(栈)
- POJ-1363 Rails(栈应用)
- ARC forbids explicit message send of'release'
- uva 10422 Knights in FEN(迭代dfs)
- JSP中include指令和include动作区别
- 闪回技术(6):闪回数据库【操作实例】
- DevExpress之ChartControl
- poj-1363-Rails(栈)
- 梳理一下JTAG控制器最基本的几个底层函数。
- .NET反编译工具Reflector及插件
- 经典矩阵入门题
- 传说中的斜率优化
- Input event驱动
- CC Prime Distance On Tree (树的点分治 + FFT)
- 01-JavaWeb-预备知识
- 使用Kscope建立Linux内核工程