Leetcode 3640. Trionic Array II

Find the maximum-sum contiguous subarray that can be partitioned (at two interior pivots) into three strict monotone runs: strictly increasing, then strictly decreasing, then strictly increasing. n is up to 1e5, nums values up to 1e9, and at least one such trionic subarray exists.