TJU 1036 模拟栈

#include"stdio.h"#include"iostream"#include"stack"using namespace std;int main(){    //freopen("a.txt","r",stdin);    int n,pos,a[1010];    while(cin>>n,n)    {        while(cin>>a[1],a[1])        {            for(int i=2;i<=n;i++)                cin>>a[i];            int pos=1;            stack<int>S;            for(int i=1;i<=n;i++)            {                S.push(i);                while(!S.empty()&&S.top()==a[pos])                {                    pos++;                    S.pop();                }            }            if(pos==n+1) cout<<"Yes"<<endl;            else cout<<"No"<<endl;        }        cout<<endl;    }    return 0;}