浦发银行算法接力赛总结/python语言/算法+建模/用户行为预测-06算法：波浪树

import sys
import math

for line in sys.stdin:  # 获取输入
    a = line.split()
    a = list(map(int, a))

    if a[0] == 0:
        print (False)
        continue

    # 填充为完全二叉树
    layer = int(math.log2(len(a))) + 1
    n = 2 ** layer - 1
    zero = [0] * (n - len(a))
    a.extend(zero)

    del a[0]

    flag = 0

    w = [True] * (layer)  # 记录每层是递增还是递减
    c = 1  # 标记当前为第几层
    last = []  # 记录每层的每对是递增还是递减
    l = 2  # 标记每层的节点总数
    cell = []  # 存储每层非0元素

    #c = bool(1 - b)  # 取反
    while l <= math.ceil(n / 2):
        cell.clear()
        for i in range(l):
            if a[i] != 0:
                cell.append(a[i])
        del a[0:l]
        if len(cell) <= 1:
            w[c] = bool(1 - w[c-1])
            c += 1
            l *= 2
            continue
        last.clear()
        k = -1
        for j in range(len(cell) - 1):
            if cell[0] == cell[1]:
                flag = 1
                break
            elif cell[0] < cell[1]:  # 严格递增
                last.append(True)
                k += 1
            elif cell[0] > cell[1]:  # 严格递减
                last.append(False)
                k += 1
            if k > 0:
                if last[k] != last[k - 1]:
                    flag = 1
                    break
            del cell[0]
        if flag == 1:
            break
        else:
            w[c] = last[0]
            if w[c] == w[c - 1] and c>1:
                flag = 1
                break
        c += 1
        l *= 2

    # print(w)
    if flag:
        print(False)
    else:
        print(True)