题解 | 01序列

from math import ceil
m = int(input())
arr_new = "".join(input().split()).split("1")
count = 0
for i in range(len(arr_new)):
    leni = len(arr_new[i])
    if leni != 0:
        if i == 0 or i == len(arr_new) - 1:
            if len(arr_new) == 1:
                count += ceil(leni / 2)
            else:
                count += leni // 2
        else:
            count += ceil(leni / 2) - 1
n = int(input())
if n <= count:
    print("true")
else:
    print("false")