Problem 3165 · Hard

Maximum Sum of Subsequence With Non-adjacent Elements

Track the best non-adjacent sum with each value skipped or taken, and re-solve after every point update.

Open the interactive visualisation