Maximum Profitable Triplets With Increasing Prices II

Given an array of prices, choose non-overlapping triplets of indices (i<j<k) whose prices are strictly increasing to maximize the total profit across chosen triplets; the problem requires designing an optimized DP/greedy solution (often with segment-tree, monotonic-queue or other DP-optimization techniques) to handle large inputs within tight time limits.