STL栈 - 火车进出栈
2016-05-02 21:48
211 查看
火车进出栈
时间限制: 1 Sec 内存限制: 128 MB题目描述
As the new term comes, the Train Station is very busy nowadays. A lot of student want to get back to school by train. But here comes a problem, there is only one railway where all the trains stop. So all the trains come in from one side and get out fromthe other side. For this problem, if train A gets into the railway first, and then train B gets into the railway before train A leaves, train A can't leave until train B leaves. The pictures below figure out the problem. Now the problem for you is, there are
at most 9 trains in the station, all the trains has an ID(numbered from 1 to n), the trains get into the railway in an order O1, your task is to determine whether the trains can get out in an order O2.
输入
The input contains several test cases. Each test case consists of an integer, the number of trains, and two strings, the order of the trains come in:O1, and the order of the trains leave:O2. The input is terminated by the end of file. More details in theSample Input.
输出
The output contains a string "No" if you can't exchange O2 to O1, or you should output a line contains "Yes".样例输入
3 123 321 3 123 312
样例输出
Yes No
提示
For the first Sample Input, we let train 1 get in, then train 2 and train 3.So now train 3 is at the top of the railway, so train 3 can leave first, then train 2 and train 1.
In the second Sample input, we should let train 3 leave first, so we have to let train 1 get in, then train 2 and train 3.
Now we can let train 3 leave.
But after that we can't let train 1 leave before train 2, because train 2 is at the top of the railway at the moment.
So we output "No".
#include<cstdio> #include<cmath> #include<iostream> #include<cstdlib> #include<algorithm> #include<string> #include<vector> #include<queue> #include<stack> #include<set> #include<list> using namespace std; int main() { int n; string a, b; while (cin >> n >> a >> b) { stack<char> s; int x=0, y=0; int ok = 1; while (y < n) { if (a[x] == b[y]) { x++; y++; } else if (!s.empty() && s.top() == b[y]) { s.pop(); y++; } else if (x < n)s.push(a[x++]); else { ok = 0; break; } } printf("%s\n", ok ? "Yes" : "No"); } return 0; }
【隔的时间有点久不记得是不是自己完成的了,应该有【大部分?】借鉴《算法竞赛入门经典》吧。。。。。】
一个栈混洗的问题恩对
相关文章推荐
- [剑指offer]连续子数组的最大和
- 【DP】最大子串和
- cookie 和session 的区别:
- bzoj4519: [Cqoi2016]不同的最小割
- Kafka设计解析(五)- Kafka性能测试方法及Benchmark报告
- 1100. Mars Numbers (20)
- 使用Docker registry镜像创建私有仓库
- Google开发者工具学习
- 全局编录服务器(GC)
- Java中Exception的种类
- 解决系统设置无法打开的问题
- HDU1398 Square Coins
- libvirt
- leetcode——141—— Linked List Cycle
- 笔记4:HttpWebRequest 与 HttpWebResponse 类
- Docker学习笔记 — Docker私有仓库搭建
- 实验7 BindService模拟通信
- HTML设置超链接字体颜色和点击后的字体颜色
- Android 使用LayerDrawable自定制SeekBar的外观
- Java网页爬虫获取邮件地址