-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstreet_parade.py
92 lines (73 loc) · 2.11 KB
/
street_parade.py
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
# Vivek Keshore
# http://www.spoj.com/problems/STPAR/
class Stack():
def __init__(self):
self.items = []
def is_empty(self):
return self.items == []
def peek(self):
if not self.is_empty():
item = self.items.pop()
self.items.append(item)
return item
# return self.items[len(self.items)-1] # Will take O(n) due to len
else:
return None
def pop(self):
if not self.is_empty():
return self.items.pop()
else:
return None
def push(self, item):
self.items.append(item)
def size(self):
return len(self.items)
def reset(self):
self.items = []
while True:
num = int(raw_input())
if num == 0:
break
data = raw_input().split()
trucks = [int(truck) for truck in data]
flag = True
side_street = Stack()
parade = Stack()
for i in xrange(num):
curr_truck = trucks[i]
side_truck = side_street.peek()
parade_truck = parade.peek()
while not side_street.is_empty():
side_truck = side_street.peek()
if side_truck <= curr_truck:
if side_truck < parade_truck:
flag = False
break
else:
side_truck = None
parade.push(side_street.pop())
else:
break
if i + 1 < num:
if curr_truck > trucks[i+1]:
if side_truck and side_truck < curr_truck:
flag = False
break
else:
side_street.push(curr_truck)
else:
if parade_truck and parade_truck > curr_truck:
flag = False
break
else:
parade.push(curr_truck)
else:
if parade_truck and parade_truck > curr_truck:
flag = False
break
else:
parade.push(curr_truck)
if flag:
print 'yes'
else:
print 'no'