Advertisement
Manioc

trail

Nov 8th, 2017
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.89 KB | None | 0 0
  1. while True:
  2.     value = int(raw_input())
  3.  
  4.     if value == 0: break
  5.     while True:
  6.         lista = map(int, raw_input().split())
  7.         num = max(lista)
  8.         aux = lista[:]
  9.         if len(lista) == 1 and lista[0] == 0:
  10.             print
  11.             break
  12.  
  13.         passa = []
  14.         agr_n = []
  15.         while len(lista) != 0:
  16.             if lista[-1] == num:
  17.                 passa.append(lista.pop(-1))
  18.                 num -= 1
  19.             elif len(agr_n) >= 1 and agr_n[-1] == num:
  20.                 passa.append(agr_n.pop(-1))
  21.                 num -= 1
  22.             else:
  23.                 agr_n.append(lista.pop(-1))
  24.         if len(agr_n) >= 1 and len(passa) >= 1 and agr_n[-1]+1 == passa[0]:
  25.             passa = agr_n + passa
  26.         else: passa = passa + agr_n
  27.        
  28.         if passa == sorted(aux) or passa == sorted(aux, reverse= True): print "Yes"
  29.         else: print "No"
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement