-
Notifications
You must be signed in to change notification settings - Fork 0
/
stpar.cpp
70 lines (65 loc) · 976 Bytes
/
stpar.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <stdio.h>
#include <stack>
#include <queue>
using namespace std;
typedef stack<int> si;
typedef queue<int> qi;
bool solve(qi &l)
{
int t;
si r;
int i=1;
bool found=false;
while(!l.empty())
{
t=l.front();
if(t==i) { found=true; break; }
r.push(t);
l.pop();
}
if(!found) return false;
l.pop();
i+=1;
while(!l.empty() && !r.empty())
{
if(l.front()==i)
l.pop();
else if(r.top()==i)
r.pop();
else
{
found=false;
while(!l.empty())
{
t=l.front();
if(t==i) { found=true; break; }
r.push(t);
l.pop();
}
if(!found) return false;
l.pop();
}
i+=1;
}
return true;
}
int main()
{
int n,i,t;
while(1)
{
scanf("%d",&n);
if(!n) break;
qi l;
for(i=0;i<n;++i)
{
scanf("%d",&t);
l.push(t);
}
if(solve(l))
printf("yes\n");
else
printf("no\n");
}
return 0;
}