{"id":"subsequence-limited-sum-query-independence","text":"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.","truth_value":"IN","source":"entries/2026/06/06/longest-subsequence-with-limited-sum-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"subsequence-limited-sum-query-independence","truth_value":"IN","reason":"premise"}]}}