问题如下：
问题 B: Rails 时间限制: Sec 内存限制: MB
提交: 解决:
[提交][状态][讨论版]
题目描述 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 <= coaches numbered in increasing order , , ..., 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 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 , , ..., N. The last line of the block contains just . The last block consists of just one line containing . 输出 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. 样例输入 样例输出 Yes
No Yes
提示
View question
利用递归的思想，可以这么写：
//模拟法：搭建stack堆栈模拟a堆栈出栈顺序以判断a堆栈是否合法出栈 #include<stdio.h>
#include<string.h>
#include<malloc.h> int main()
{
int t,n,i,len,flag;
int a[],stack[];
int cur,pos,top;
while(scanf("%d",&t)!=EOF)
{
if(t==)
return ;
while()
{
cur=;pos=;top=;
for(i=;i<t;i++)
{
scanf("%d",&n);
if(i== && n==)
{
printf("\n\n");
t=;
}
a[i]=n;
} flag=;
if(t)
{ //cur=1;pos=0;top=0;
//top代表 stack 堆栈中有几个数
//pos代表已从堆栈中取出的数目，也代表a堆栈中待取数
//cur代表欲往stack堆栈中加入的新数 stack[top] = cur;
while (pos < t && top < t)
{
if (a[pos] == stack[top])//如果stack栈顶数 等于 a堆栈中待取数
{
pos++;//则取出a堆栈中待取数
top--;//并在a堆栈中往后移一位 , 同时将 stack 堆栈前移一位 //针对 当前stack 为空时， 则在stack堆栈中添加入新数cur
if (top < )
{
top = ;
stack[top] = ++cur;
}
}
else//否则在 stack堆栈中加入新的数
stack[++top] = ++cur; //检查状态
/*printf("cur =%d pos=%d top=%d flag=%d\n",cur,pos,top,flag++);
for(i=0;i<=top;i++)
printf("%d ",stack[i]);
printf("\n");*/
}
if (top == t)
printf("No\n");
else
printf("Yes\n");
}
if(t==)
break;
}
}
return ;
}
除此之外，还有一个问题，比如要求堆栈中合法出栈顺序次数
//摘自http://hi.baidu.com/onlys_c/item/be805c428dde9dd6c0a59213
//整理by Jeremy Wu
/*sum作为全局变量记录共可能多少种情况*/
int sum = ;
/*描述：递归计算共可能出现的出栈序列，
无返回值参数：inStack
-- 目前存放于栈中的元素个数wait
-- 目前还未进栈的元素个数out
-- 目前已经出栈的元素个数num
-- 一共有多少个元素n*/
void f(int inStack, int wait, int out, int num){ /*如果全部元素都出栈，表明有了一种新情况，总数加一*/
if (out == num)
sum++; /*否则继续递归衍生新的状态*/
else{
if (inStack > )/*衍生方法1：让一个元素出栈*/
f(inStack-, wait, out+, num);
if (wait > )/*衍生方法2：让一个元素进栈*/
f(inStack+, wait-, out, num);
} }
/*用main函数调用*/
int main()
{
/*一共有n个元素*/
int n = ;
/*刚开始时栈中有0个元素，有n个元素等待，有0个元素出了栈，共有n个元素*/
f(, n, , n);
printf ("%d\n", sum);
return ;
}
