Envío 765

Código

class Node(object):
    def __init__(self, value, idx):
        self.parent = None
        self.children = []
        self.value = value  # height
        self.idx = idx  # in the original array


def adopt(parent, child):
    parent.children.append(child)
    child.parent = parent


def case(n_arr, arr):
    tree = []
    view_heights = [-1] * n_arr
    
    for idx, val in enumerate(arr[::-1]):
        idx = n_arr - idx - 1
        node = Node(val, idx)
        if len(tree) == 0:
            tree.append(node)
            continue
        else:
            # search parent
            last_node = tree[-1]
            while True:
                if node.value < last_node.value:
                    # add as child of last_node
                    adopt(last_node, node)
                    view_heights[idx] += last_node.value + 1
                    tree.append(node)
                    break
                else:
                    # go up the tree
                    if last_node.parent is None:
                        # add node as new root
                        adopt(node, last_node)
                        tree.append(node)
                        break
                    else:
                        last_node = last_node.parent
    return view_heights

if __name__ == "__main__":
    num_cases = int(input())
    for case_nr in range(1, num_cases+1):
        n_arr = int(input())
        arr = list(map(int, input().split(' ')))
        view_heights = case(n_arr, arr)
        print(f'Case #{case_nr}: ' + ' '.join(map(str, view_heights)))