杭电1022 train problom
2015-07-27 20:41
555 查看
源代码:
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <stack>
using namespace std;
int main()
{
int n,i,j,k;
char a[10],b[10],c[10];
while(~scanf("%d%s%s",&n,a,b))
{
getchar();
stack<char>s;
while(!s.empty())
s.pop();
//s.push(a[0]);
i=j=k=0;
while(i<n)
{
s.push(a[i++]);
c[k++]=1;
while(!s.empty()&&s.top()==b[j])
{
s.pop();
j++;
c[k++]=0;
}
}
if(s.empty()==1)
{
printf("Yes.\n");
{
for(i=0;i<k;i++)
{
if(c[i]==1)
printf("in\n");
else
printf("out\n");
}
}
}
else
{
printf("No.\n");
}
printf("FINISH\n");
}
return 0;
}
注意:栈的使用 STL中栈的五个常用函数的用法
1.top()返回栈顶数据
2.pop()弹出栈顶数据
3.push()添加数据
4.empty()判断栈是否为空
5.size()返回栈中数据个数
(此题杭电oj上提交时用G++语言提交,C++为wr)
(用数组c[]及for循环控制"in","out"的输出)
Train Problem I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25961 Accepted Submission(s): 9809
[align=left]Problem Description[/align]
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.
![](http://acm.hdu.edu.cn/data/images/1022-1.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-2.jpg)
![](http://acm.hdu.edu.cn/data/images/1022-3.jpg)
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
3 123 321 3 123 312
[align=left]Sample Output[/align]
Yes. in in in out out out FINISH No. FINISH HintHint 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.".
相关文章推荐
- Airbnb创始人:屌丝的逆袭之路
- epoll()无论涉及wait队列分析
- hdu杭电1702 ACboy needs your help again!【栈和队列】
- Train Problem I
- PAINT和WM_ERASEBKGND消息
- 为什么delegate属性使用assigne而不是retain?
- 220Contains Duplicate III
- Factorial Trailing Zeroes
- hdu-1022 Train Problem I (栈的简单应用)
- HDU-2057 A+B Again
- 绑定远程服务的流程aidl
- HDU 2925 Musical Chairs(约瑟夫环问题)
- Climbing Stairs
- offsetof与container_of宏(个人理解)
- poj3250 Bad Hair Day
- hpu 1022&&nyoj 150 Train Problem I 【栈】
- Container With Most Water
- hdu杭电1002 Train Problem I【栈】
- 杭电1022 Train Problem I
- idea 14 Error: Failed to create a child event loop