题目1366：栈的压入、弹出序列

九度提醒time exceed

囧，不知为啥，对照书中觉得是没错的。

#include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

bool fitStack(vector<int> &v1,vector<int> &v2)
{
	stack<int> s1;
	int i1=0,i2=0;
	for(;i1<v1.size();)
	{
		if(v1[i1]==v2[i2])
			{
				i1++;i2++;
			}
			else if(!s1.empty() && s1.top()==v2[i2])
				{
					s1.pop_back();
					i2++;
				}
				else
					{
						s1.push_back(v1[i1]);
					}
	}
	
	for(;i2<v2.size();i2++)
	{
		if(!s1.empty() && s1.top()==v2[i2])
				{
					s1.pop_back();
				}
				else
					{
						break;
					}
	}
}

int main()
{
	int vec_num;
	while(cin>>vec_num)
	{
			string line;
			getline(cin,line);
			istringstream tmp(line);
			vector<int> stack1,stack2;
			int k;
			while(tmp>>k)
			{
				stack1.push_back(k);
			}
			istringstream tmp2(line);
			while(tmp2>>k)
			{
				stack2.push_back(k);
			}
			if(fitStack(stack1,stack2)) cout<<"Yes\n";
				else cout<<"No\n";
	}
	
	return 0;
}