Hi CF users, I am stuck on this problem for a long while now. Even after reading the tutorial I am not convinced regarding the trajectory of the ball. Can anybody help me with a simple explanation of the solution?

Thanks in advance.

I am quite weak in DP and Bitmasking concept. I need help to solve this problem https://www.codechef.com/problems/TSHIRTS

Thanks.

problem link I am doing this question using AVL tree but I am not able to handle the duplicate values in the input. First , I thought of using a vector for each node but that will turn out to be a TLE. Any help would be really appreciated.

Thanks in advance.

I know about segment trees. But here I am stuck.I want to set all the values within an interval [l,r] to a constant c. and now after doing all the updates on the array, I want to find a[i] where 0<i<=n.