思路：链表转数组 + 单调栈（从后往前遍历）。与「下一个更大元素」模板一致，仅需将链表值先提取到数组。
Number: All the pips in this space must add up to the number.
，详情可参考快连下载-Letsvpn下载
The capacity of each node (how many points it can hold before splitting) controls the shape of the tree. A low capacity means nodes split early, producing a deep tree with many small cells. A high capacity means nodes tolerate more points before splitting, producing a shallow tree with larger cells.
tee() splits a stream into two branches. It seems straightforward, but the implementation requires buffering: if one branch is read faster than the other, the data must be held somewhere until the slower branch catches up.
这一特征对于屏幕的色彩通透度、亮度和可视角度等等关键参数都至关重要，但也构成了那个导致「窥屏」的矛盾特性。