Rails铁轨(栈)
2016-02-25 21:01
711 查看
Description
Download as PDF
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.
\begin{picture}(6774,3429)(0,-10)
\put(1789.500,1357.500){\arc{3645.278}{4.7247}...
...tFigFont{14}{16.8}{\rmdefault}{\mddefault}{\updefault}Station}}}}}
\end{picture}
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 \leŸ 1000$ coaches numbered in increasing order $1, 2, \dots,
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 $a_1. a_2, \dots, a_N$. 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 file 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, \dots, N$ The last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it
contains No. In addition, there is one empty line after the lines corresponding to one block of the input file. There is no line in the output file corresponding to the last ``null'' block of the input file.
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
Download as PDF
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.
\begin{picture}(6774,3429)(0,-10)
\put(1789.500,1357.500){\arc{3645.278}{4.7247}...
...tFigFont{14}{16.8}{\rmdefault}{\mddefault}{\updefault}Station}}}}}
\end{picture}
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 \leŸ 1000$ coaches numbered in increasing order $1, 2, \dots,
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 $a_1. a_2, \dots, a_N$. 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 file 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, \dots, N$ The last line of the block contains just 0.
The last block consists of just one line containing 0.
Output
The output file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains Yes if it is possible to marshal the coaches in the order required on the corresponding line of the input file. Otherwise it
contains No. In addition, there is one empty line after the lines corresponding to one block of the input file. There is no line in the output file corresponding to the last ``null'' block of the input file.
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
#include<cstdio> #include<stack> using namespace std; const int N = 1005; int n, tar , A, B; int main() { while (scanf ("%d", &n), n) { while (scanf ("%d", &tar[1]), tar[1]) { for (int i = 2; i <= n; ++i) scanf ("%d", &tar[i]); stack<int> sta; A = B = 1; bool ok = true; while (B <= n) { if (A == tar[B]) { ++A; ++B; } else if (!sta.empty() && sta.top() == tar[B]) { sta.pop(); ++B; } else if (A <= n) sta.push (A++); else { ok = false; break; } } printf (ok ? "Yes\n" : "No\n"); } printf("\n"); } return 0; }
相关文章推荐
- hdu 1789 Doing Homework Again!
- MessagingTimeout: Timed out waiting for a reply to message ID
- main()函数
- Failed to download samples index, please check your connection and try again 解决
- how to tell if a library contain debug symbols or not
- Ubuntu下安装ideaIU14并添加桌面快捷方式
- type_traits之has_* 系列
- 安装cuda时 提示toolkit installation failed using unsupported compiler解决方法
- “Unable to open log device '/dev/log/main': No such file or directory”
- C- C&AI
- 游戏AI 行为树
- GCD Again
- http://blog.csdn.net/leo115/article/details/7532677
- Error inflating class com.baidu.mapapi.map.MapView
- raid独立磁盘冗余阵列
- "railroad diagram"
- LINK1123:failure during conversion to COFF:file invalid or corrupt
- Ajaxadr ajax跨域请求crossdomain
- mybaits in
- HDOJ Train Problem I