#include<cstdio>
#include<stack>
using namespace std;
const int maxn=1100;
int n,a[maxn];
int main()
{
while(scanf("%d",&n)==1)///输入数组长度,
{
stack<int> s;
int A=1,B=1;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
int ok=1;
while(B<=n)
{
if(A==a[B])
{
A++;
B++;
}
else
if(!s.empty()&&s.top()==a[B])
{
s.pop();
B++;
}
else
if(A<=n)
s.push(A++);
else
{
ok=0;
break;
}
}
printf("%s\n",ok? "Yes" : "No");
}
return 0;
}
栈入门(判断出栈顺序是否可行)
最新推荐文章于 2023-08-05 21:17:45 发布