You are viewing a single comment's thread. Return to all comments →
from collections import deque testcount = int(input()) dqelemcount = [] dq = [] counter = 0 element1 = 0 element2 = 0 element3 = 0 _break = False for x in range(testcount): dqelemcount.append(int(input())) dq.append(deque(int(x) for x in input().split())) for y in range(testcount): while counter < dqelemcount[y] and len(dq[y]) > 0: if(len(dq[y]) == 1): dq[y].pop() else: element1 = dq[y].popleft() element2 = dq[y].pop() if element1 > element2: if (element3 == 0): element3 = element1 dq[y].append(element2) else: if element3 > element1 or element3 == element1: element3 = element1 else: print("No") _break = True break dq[y].append(element2) elif element1 == element2: if (element3 == 0): element3 = element1 else: if element3 > element1 or element3 == element1: element3 = element1 else: print("No") _break = True break elif element1 < element2: if (element3 == 0): dq[y].appendleft(element1) element3 = element2 else: if (element3 > element2) or (element3 == element2): element3 = element2 else: print("No") _break = True break dq[y].appendleft(element1) counter += 1 if _break == False: if (len(dq[y]) == 0): print("Yes") else: print("No") _break = False counter = 0 element1 = 0 element2 = 0 element3 = 0
Seems like cookies are disabled on this browser, please enable them to open this website
Piling Up!
You are viewing a single comment's thread. Return to all comments →