正文

poj 1363 Rails in PopPush City &&【求堆栈中合法出栈顺序次数】

IP云
IP云V管理员/5 阅读
08/06
提示：扫一扫查出行
【扫一扫了解最新限行尾号】
复制提示

问题如下：

问题 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
NoYes
提示

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 ;
}

poj 1363 Rails in PopPush City &&【求堆栈中合法出栈顺序次数】的更多相关文章

  1. OpenJudg &sol; Poj 1363 Rails

    1.链接: http://poj.org/problem?id=1363 http://bailian.openjudge.cn/practice/1363 2.题目: Rails Time Limi ...

  2. POJ 1363 Rails（栈）

    题目代号:POJ 1363 题目链接:http://poj.org/problem?id=1363 题目原题: Rails Time Limit: 1000MS   Memory Limit: 100 ...

  3. POJ 1363 Rails

    Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 21728   Accepted: 8703 Descriptio ...

  4. poj 1363 Rails &lpar;【栈的应用】 刘汝佳的写法 &ast;学习&rpar;

    Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25964   Accepted: 10199 Descripti ...

  5. poj 1363 Rails 解题报告

    题目链接:http://poj.org/problem?id=1363 题意:有一列火车,车厢编号为1-n,从A方向进站,向B方向出站.现在进站顺序确定,给出一个出站的顺序,判断出站顺序是否合理. 实 ...

  6. POJ 1363 Rails&lpar;栈&rpar;

    思路:将出车站的顺序存入数组train,由于入车站的顺序是固定的,为1~N,所以用P表示进站的车,初始为1. 接下来举例说明吧: 原来入站顺序:    1 2 3 4 5 读入的出战顺序: 3 4 2 ...

  7. POJ1363 Rails 验证出栈序列问题

    题目地址: http://poj.org/problem?id=1363 此题只需验证是否为合法的出栈序列. 有两个思路: 1.每个已出栈之后的数且小于此数的数都必须按降序排列.复杂度O(n^2),适 ...

  8. ZOJ 1542 POJ 1861 Network 网络 最小生成树，求最长边，Kruskal算法

    题目连接:problemId=542" target="_blank">ZOJ 1542 POJ 1861 Network 网络 Network Time Limi ...

  9. POJ 3259 Wormholes（最短路径，求负环）

    POJ 3259 Wormholes(最短路径,求负环) Description While exploring his many farms, Farmer John has discovered ...

随机推荐

  1. Java集合框架练习-计算表达式的值

    最近在看<算法>这本书,正好看到一个计算表达式的问题,于是就打算写一下,也正好熟悉一下Java集合框架的使用,大致测试了一下,没啥问题. import java.util.*; /* * ...

  2. LSD-SLAM深入学习（1）-基本介绍与ros下的安装

    前言 借鉴来自RGB-D数据处理的两种方法-基于特征与基于整体的,同样可以考虑整个图片的匹配,而不是只考虑特征点的…… 一般这种稠密的方法需要很大的计算量,DTAM: Dense tracking a ...

  3. QT编写上位机程序一定要初始化变量以及谨慎操作指针

    背景: 在编写QT上位机界面时,界面在运行的时候经常出现卡死或者直接挂掉的怪现象. 正文: 上位机有个函数为check_receive():该函数的作用为定时调用循环检测USB是否有数据.若有,则将信 ...

  4. HDU&lowbar;1254——推箱子&comma;两次BFS

    这题做的一把鼻涕一把泪,果断考虑不周555 Problem Description 推箱子是一个很经典的游戏.今天我们来玩一个简单版本.在一个M*N的房间里有一个箱子和一个搬运工,搬运工的工作就是把箱 ...

  5. css布局详解（一）——盒模型

    一.网页布局的几种情况 今天让我们总结一下在css布局的各种情况做一个总结,为我们以后布局网页时做一个参考. 先看一张图,这是去年cssConf大会时阿里的 @寒冬winter 老师放出来的: 如图所 ...

  6. ASP&period;NET中的Request和Respone对象的使用

            前台<body>中的表单代码: ASP.NET对象有如下几个: 本文从“asp.net中通过from表单submit提交到后台的实例”来谈谈Request和Response ...

  7. IM 融云 之 初始化及登录

    融云是没有用户体系的,用户登录需要获取token,测试时可以使用网站提供的接口,但是正式是要通过服务器调用专门的接口从融云获取的.并且我没看到融云的重连机制,不知道是否已在SDK内部实现. 现在看来, ...

  8. Hibernate 学习笔记 - 1

    一.Hibernate 的环境搭建.配置及 HelloWorld 1.在 Eclipse 中搭建 Hibernate 环境 下载 Hibernate 离线 jar 包(jbosstools-4.4.4 ...

  9. ssm客户管理系统的设计与实现

    ssm客户管理系统 注意:系统是在实现我的上一篇文章 https://www.cnblogs.com/peter-hao/p/ssm.html的基础上开发 1     需求 1.1   添加客户 客户 ...

  10. Exp4 恶意代码分析 20164313 杜桂鑫

    1.实践目标 1.1是监控你自己系统的运行状态,看有没有可疑的程序在运行. 1.2是分析一个恶意软件,就分析Exp2或Exp3中生成后门软件:分析工具尽量使用原生指令或sysinternals,sys ...