You are viewing a single comment's thread. Return to all comments →
Test_cases = int(input()) sizes_of_block =[] blocks = [] for i in range(Test_cases): size_of_block = int(input()) sizes_of_block.append(size_of_block) block = (input().split()) block_int = [int(item) for item in block] blocks.append(block_int) def piles_up(size,block) : count = max(block) if size%2==0: for i in range(int(size/2)) : if (block[i]>=block[(size-1)-i]) and (block[i]<=count): count = block[i] elif (block[i]<=block[(size-1)-i]) and (block[(size-1)-i]<=count): count = block[(size-1)-i] else: break if count == block[int(size/2)] or count==block[int(size/2)-1]: return print("yes") else : return print("No") else: for i in range(int(size/2)+1) : if (i == int(size/2)) and (block[(i)]<=count) : count = block[i] elif (block[i]>=block[(size-1)-i]) and (block[i]<=count): count = block[i] elif (block[i]<=block[(size-1)-i]) and (block[(size-1)-i]<=count): count = block[(size-1)-i] else: break if count == block[int(size/2)] : return print("yes") else : return print("No") for k in range(Test_cases): piles_up(sizes_of_block[k],blocks[k])
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 →