We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Collections
  4. Piling Up!
  5. Discussions

Piling Up!

  • Solspin
     + 0 comments

    Saw lots of deque, but I think a direct index approach is faster no? Avoids updating the list.

    for i in range(int(input())):
    n = int(input())
    a = 0
    b = n-1
    l = list(map(int,input().split()))
    t = max(l[a],l[b])
    
    while a != b: 
        if l[a] >= l[b]:
            if l[a]<= t:
                outcome = 'Yes'
                a += 1
            else:
                outcome = 'No'
                break
        else:
            if l[b]<= t:
                outcome = 'Yes'
                b -= 1
            else:
                outcome = 'No'
                break
            
    print(outcome)