Leetcode 3660. Jump Game IX

Given an array where you may jump right only to strictly smaller elements and left only to strictly larger ones, compute for each index the maximum array value reachable by any sequence of such jumps. The core challenge is modeling these directed jumps and computing reachability maxima efficiently (commonly using monotonic stacks to build edges and graph/DP or SCC traversal to propagate maximums).