十六個天亮

Problem solving record for LeetCode 2874. Maximum Value of an Ordered Triplet II.

A collection of LeetCode 2025/04 daily challenge.

Problem solving record for LeetCode 2127. Maximum Employees to Be Invited to a Meeting.

Problem solving record for AtCoder Beginner Contest 389.

Problem solving record for LeetCode 1286. Iterator for Combination.

Problem solving record for LeetCode 295. Find Median from Data Stream.

Problem solving record for LeetCode 53. Maximum Subarray.

Problem solving record for LeetCode 31. Next Permutation.

Problem solving record for AtCoder Beginner Contest 388. Rank 821.

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

判斷是否能避開禁止區間抵達終點；以布林 DP 表示可達性，利用矩陣快速冪批次跳過連續好格與壞格。

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

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

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

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