Hey Codeforces community,

I'm currently trying to solve problem 2069C from a recent Codeforces round and am exploring a dynamic programming approach for it. However, I'm struggling to implement it efficiently.

Here's what I have understood so far: Problem link -> 2069C - Beautiful Sequence A brute force solution seems infeasible due to [mention constraints]. I believe DP can be applied by but i am new to dp , so i am not getting how to think help