Problem 3915 · Hard

Maximum Sum of Alternating Subsequence With Distance at Least K

Activate distant predecessors, query opposite-direction DP states, and reconstruct an optimal zigzag subsequence.

Open the interactive visualisation