#include<iostream>
#include<stack>
using namespace std;
void main()
{
	stack<int> coach,station;       //coach????????????????????station????????
	int a[1000],n,nn;
	cin>>n;
	nn=n;
	while(n!=0){
		cin>>a[0];
		while(a[0]!=0){
			for(int i=1;i<n;i++)
				cin>>a[i];
			for(int j=0;j<n;j++)                     //????????????????coach??
				coach.push(a[j]);
			while(n>0){
				if((!coach.empty())&&coach.top()==n){ //coach????????????????????????????????
					coach.pop();                      //????????????n-1
					n--;
					continue;
				}
				else if((!station.empty())&&station.top()==n){//station????????????????????????????
					station.pop();                       //????????????????n-1
					n--;
					continue;
				}
				else if((!coach.empty())&&coach.top()!=n){ //coach????????????????????????
					station.push(coach.top());        //??????????station????????coach????????
					coach.pop();
				}
				else if(coach.empty()&&(!station.empty())&&station.top()!=n){  //coach????????station??????????????????
					cout<<"No"<<endl;                 //t??????1????????
					n=-1;                             //n??-1??????while????
				}
			}
			if(n==0)
				cout<<"Yes"<<endl;
			n=nn;
			cin>>a[0];
			if(a[0]==0){ 
				while(station.empty()==false)
					station.pop();
				while(coach.empty()==false)
					coach.pop();
			}
		}
		cin>>n;
		cout<<endl;
		nn=n;
	}
}

• Re:代码很短觉得情况都考虑到了可还是WA,谁帮忙看看啊!!! (1528) 0761 2005-09-21 23:53:59