POJ:1702 Rails(栈的应用)
2016-07-25 23:53
651 查看
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
题目大意:给你一个数n,然后1~n节车厢入栈,给你一个序列,问这n节车厢能否按照所给序列出栈。
解题思路:模拟过程。(321654这个输出Yes,用这个比较好理解栈)
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
stack<int>q;
int a[1010];
while(scanf("%d",&a[0])!=EOF)
{
if(a[0]==0)
break;
for(int i=1;i<n;i++)
{
scanf("%d",&a[i]);
}
int k=0;//控制所给序列的角标
for(int i=1;i<=n;i++)
{
q.push(i);//入栈
while(a[k]==q.top())//“对对碰 ”。。。
{
q.pop();
k++;
if(q.empty())
{
break;
}
}
}
if(k==n)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
printf("\n");
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 31395 | Accepted: 12198 |
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
题目大意:给你一个数n,然后1~n节车厢入栈,给你一个序列,问这n节车厢能否按照所给序列出栈。
解题思路:模拟过程。(321654这个输出Yes,用这个比较好理解栈)
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
stack<int>q;
int a[1010];
while(scanf("%d",&a[0])!=EOF)
{
if(a[0]==0)
break;
for(int i=1;i<n;i++)
{
scanf("%d",&a[i]);
}
int k=0;//控制所给序列的角标
for(int i=1;i<=n;i++)
{
q.push(i);//入栈
while(a[k]==q.top())//“对对碰 ”。。。
{
q.pop();
k++;
if(q.empty())
{
break;
}
}
}
if(k==n)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
printf("\n");
}
return 0;
}
相关文章推荐
- C++基于栈实现铁轨问题
- 浅析C语言中堆和栈的区别
- C语言栈的表示与实现实例详解
- C语言实现颠倒栈的方法
- 算法系列15天速成 第十天 栈
- 一看就懂:图解C#中的值类型、引用类型、栈、堆、ref、out
- Array栈方法和队列方法的特点说明
- java数据结构之java实现栈
- 浅析栈区和堆区内存分配的区别
- 用Java代码实现栈数据结构的基本方法归纳
- 用PHP解决的一个栈的面试题
- 浅谈C#中堆和栈的区别(附上图解)
- C#使用Object类实现栈的方法详解
- JavaScript数据结构与算法之栈详解
- C语言之栈和堆(Stack && Heap)的优缺点及其使用区别
- Python实现栈的方法
- JavaScript数组的栈方法与队列方法详解
- JavaScript数据结构与算法之栈与队列
- JavaScipt中栈的实现方法
- Java中堆和栈的区别详解