十六個天亮

對每個區間求最多可同時配成幾組鏡餅，預處理每個小餅所需的大餅位置，配合線段樹與二分答案查詢。

給定已排序麻糬大小，利用最小上層配最大下層的貪心結構二分答案，並可用雙指標與前綴最大值將檢查加速到常數時間。

模擬給石頭的過程，利用差分陣列維護每個人會收到的石頭數量，將區間加值操作優化至 O(1)。

在已排序的麻糬大小中，用雙指標統計每個下層麻糬可搭配的上層麻糬數量。

給定正整數陣列，求最大子集大小使其中所有元素的位元 AND 大於 0。關鍵在於枚舉每個位元，統計該位元為 1 的元素個數。

用計數排序取代一般排序，再用兩個單調佇列模擬每次取出最小兩堆的 Huffman 合併過程。

Problem solving record for AtCoder Beginner Contest 380. Rank 525.

Problem solving record for AtCoder Beginner Contest 378. Rank 455.

Problem solving record for LeetCode 3185. Count Pairs That Form a Complete Day II.

Problem solving record for LeetCode 3184. Count Pairs That Form a Complete Day I.

Problem solving record for LeetCode 2463. Minimum Total Distance Traveled.

Problem solving record for LeetCode 1671. Minimum Number of Removals to Make Mountain Array.

Problem solving record for LeetCode 2501. Longest Square Streak in an Array.

Problem solving record for LeetCode 685. Redundant Connection II.

Problem solving record for LeetCode 1277. Count Square Submatrices with All Ones.