1.链接: http://poj.org/problem?id=1363 http://bailian.openjudge.cn/practice/1363 2.题目: Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 24612   Accepted: 9644 Description There is a famous railway station in PopPush City. Country ther…

题目代号:POJ 1363 题目链接:http://poj.org/problem?id=1363 题目原题: Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34585   Accepted: 13434 Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The s…

题目链接:http://poj.org/problem?id=1363 题意:有一列火车,车厢编号为1-n,从A方向进站,向B方向出站.现在进站顺序确定,给出一个出站的顺序,判断出站顺序是否合理. 实际上是模拟栈的过程,而栈的特点是先进后出.另外一个麻烦的地方就是输入输出格式问题. 本题实现提供两种方法:没有用到STL栈和有用到STL栈 #include <iostream> // 法二:头文件多包含一个 #include <stack> using namespace std;…

Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 21728   Accepted: 8703 Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds we…

问题如下: 问题 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…

Rails Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 25964   Accepted: 10199 Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds w…

思路:将出车站的顺序存入数组train,由于入车站的顺序是固定的,为1~N,所以用P表示进站的车,初始为1. 接下来举例说明吧: 原来入站顺序:    1 2 3 4 5 读入的出战顺序: 3 4 2 5 1 按照train数组的顺序来执行, 1.一开始p=1,i=1: p与train[i]=3不相等,将p(1)入栈,p++:再比较不相等,将p(2)入栈,p++: p=train[3],则i++,p++: 2.i=2: 先比较train[i]与栈顶元素2是否相同,不相同,则与p比较. train…

这是一道数据结构的问题,用到了栈的知识.题目大意讲的是每一次有N辆车从A到B,但是要将车辆的顺序重新排列,可以通过中转站C来辅助排列,但是C符合先进后出的原则,这一点和栈的特性相同. 整个重新排序的过程其实有三种操作,A->C,C->B,A->C->B.其中A->C和C->B表示排序中需要用到栈的特性的操作,A->C->B表示该车在A中的顺序和在B中的顺序相同,可以直接沿用无需借助栈的特性. #include<stdio.h>#include&l…

水题,主要是思路清晰,判断明确. 记x为A站最前方的车,y表示下一列要进入B站的车厢,初识时,x=1;y=a1;C=[]; 在调度过程中: if(y==0)那么调度成功,退出模拟过程:否则 if(x==y)就是说接下来进站的正好是要出去的,那就直接让它A—>B 否则 if(C不空 && y=(最后进入C的火车)) 让车从C开出进入B  否则 if(x!=0)那么车 A—>C 否则  无解 #include<cstdio> #include<cstring>…

poj1363,这道题是数据结构与算法中的经典问题,给定一组进栈顺序,问栈有多少种出去的顺序. #include<stdio.h> #include <stack> #include <iostream> #include <cstring> using namespace std; int main() { // freopen("in.txt","r",stdin); int n; while(scanf(&quo…