hdu 1022 Train Problem I (栈的简单应用)
来源:互联网 发布:大麦户源码安装 编辑:程序博客网 时间:2024/05/22 04:44
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description
As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over the world ^v^). 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 from the 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.
Input
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 the Sample Input.
Output
The output contains a string "No." if you can't exchange O2 to O1, or you should output a line contains "Yes.", and then output your way in exchanging the order(you should output "in" for a train getting into the railway, and "out" for a train getting out of the railway). Print a line contains "FINISH" after each test case. More details in the Sample Output.
Sample Input
3 123 3213 123 312
Sample Output
Yes.inininoutoutoutFINISHNo.FINISHFor 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.".HintHint
题意:给出一个n,有两个序列,每个序列里有n个元素,问能不能利用栈把第一个序列变成第二个序列。
分析:栈的简单应用,注意每次都要把栈清空。WA了好几次之后才发现我的栈没清空。或者把栈定义在while循环里边也行。
#include<stdio.h>#include<string.h>#include<stack>using namespace std;int main(){ int n, i, j, k, flag[50]; char s1[15], s2[15];stack <char> s; while(~scanf("%d %s%s",&n,s1,s2)) { while(!s.empty()) s.pop(); //也可以不写这一句,把 stack <char> s; 就可以了 memset(flag,-1,sizeof(flag)); j = k = 0; for(i = 0; i < n; i++) { s.push(s1[i]); flag[k++] = 1; while(!s.empty() && s.top() == s2[j]) { flag[k++] = 0; s.pop(); j++; } } if(j == n) { printf("Yes.\n"); for(i = 0; i < k; i++) { if(flag[i]) printf("in\n"); else printf("out\n"); } } else printf("No.\n");printf("FINISH\n"); } return 0;}
1 0
- hdu 1022 Train Problem I (栈的简单应用)
- Hdu 1022 Train Problem I (栈的简单应用)
- HDU 1022 Train Problem I(栈的简单应用)
- hdu-1022 Train Problem I (栈的简单应用)
- hdu 1022 Train Problem I(栈的应用。。。)
- hdu 1022 Train Problem I(栈的应用)
- HDU 1022 Train Problem I(栈的应用)
- hdu 1022 Train Problem I (栈的应用)
- HDU.1022 Train Problem I【栈的简单应用】(3.14)
- hdu Train Problem I(栈的简单应用)
- hdu 1022 Train Problem I(栈的应用+STL)
- hdu 1022 Train Problem I (栈的应用)
- HDU 1022:Train Problem I(堆栈的基本应用)
- HDU 1022 Train Problem I 简单的栈
- 1022 Train Problem I 栈的简单应用
- hdoj1022 Train Problem I(栈的简单应用)
- hdu 1022 Train Problem I(简单模拟+栈)
- hdu 1022 Train Problem I(栈)
- Java第四章【流程控制与数组、数组的操作【遍历、排序、查找】】
- 第五十五天【java虐我千百遍,我待java如初恋】
- java基础总结
- Remove Duplicates from Sorted List II 删除链表中的元素(不保留重复)
- QT在终端运行时出现ptrace:operation not permitted的解决方法
- hdu 1022 Train Problem I (栈的简单应用)
- 【资料】Ford-Fulkerson Algorithm for Maximum Flow Problem
- 数据库设计说明书-机房收费系统
- 黑马程序员-->21_银行管理系统
- 今天心情不错,早早完成了任务。
- wikioi 1365 浴火银河星际跳跃
- Android的布局介绍
- wikioi 1078 最小生成树
- lock的初始化值