Status: IN
Each query is answered in O(log n) via binary search against a shared prefix array built once in O(n log n); queries do not interact with each other.
Source: entries/2026/06/06/longest-subsequence-with-limited-sum-solution.md
JSON