https://www.luogu.com.cn/record/33534943
by 帅皮的瓜粉 @ 2020-05-11 20:11:35
@[帅皮的瓜粉](/user/330451) 一个数据点就下载吧
by EastSnowLotus @ 2020-05-11 20:17:15
@[和平相处](/user/337878) UVA的不珂以下载
by 帅皮的瓜粉 @ 2020-05-11 20:18:00
@[帅皮的瓜粉](/user/330451) 那就没办法了。。。
by EastSnowLotus @ 2020-05-11 20:22:31
应该是第一个点TLE后就不再继续测下去了
by SUNCHAOYI @ 2020-05-11 20:31:22
UVA就只有一个点
by ADay @ 2020-05-11 20:32:51
@[SUNCHAOYI](/user/183603) @[ADay](/user/312393) 两位巨佬能帮我看看哪里错了吗，这是作业啊啊啊啊啊
by 帅皮的瓜粉 @ 2020-05-11 20:34:39
经过一番调试T是不T了，但WA了
by 帅皮的瓜粉 @ 2020-05-11 20:35:12
@[帅皮的瓜粉](/user/330451) 我不是巨佬，wtcl
by ADay @ 2020-05-11 20:35:20
```
#include<bits/stdc++.h>
using namespace std;
stack <int>st;
int a[10005],r[10005];
int main()
{
int n;
int x;
while(scanf("%d",&n),n)
{
while(scanf("%d",&x)!=-1&&x>0)
{
int flag=1;
a[0]=x;
for(int i=1;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
r[i-1]=i;
}
int j=0;
for(int i=0;i<n;i++)
{
if(!st.empty()&&a[i]==st.top())
{
st.pop();
continue;
}
else
{
while(a[i]>r[j])
{
st.push(r[j]);
j++;
}
if(a[i]==r[j])
{
j++;
continue;
}
else
{
flag=0;
}
}
}
if(flag)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
}
return 0;
}
```
by 帅皮的瓜粉 @ 2020-05-11 20:35:22