标签：des   style   http   io   ar   color   os   sp   for   

Train Problem I

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.

3 123 321
3 123 312

Yes.
in
in
in
out
out
out
FINISH
No.
FINISH

Hint

#include<stdio.h> 
//#include<iostream>
#include<stack>
using namespace std;
char a[11],b[11];
int main()
{

	int n;
	bool teg[11];
	while(~scanf("%d",&n))
	{  
	    stack<char> ss;
		int i,t,k;
		scanf("%s",a);
		scanf("%s",b);
		t=0;k=0;
		for(i=0;i<n;++i)
		{
			ss.push(a[i]);
			teg[k++]=1;
			while(!ss.empty()&&ss.top()==b[t])
			{
				t++;
				ss.pop();
				teg[k++]=0;
			}
		}
		if(ss.empty()&&t==n)
		{
			printf("Yes.\n");
			for(i=0;i<k;++i)
			{
				if(teg[i]==true)
				printf("in\n");
				else
				printf("out\n");
			}
			printf("FINISH\n");
		}
		else
		printf("No.\nFINISH\n");;
	}
	return 0;
}

//STL栈的应用:

push(x) 将x加入栈中，即入栈操作

pop() 出栈操作(删除栈顶)，只是出栈，没有返回值

top() 返回第一个元素(栈顶元素)

size() 返回栈中的元素个数

empty() 当栈为空时，返回 true

hdu-1022-Train Problem I

标签：des   style   http   io   ar   color   os   sp   for   

原文地址：http://blog.csdn.net/qq_18062811/article/details/41910021