Hi. i am a beginner in CP. i know only python. is there a way of solving 1994C - Hungry Games, without using dynamic programming? i tried to make subsegments and iterating through each one but i am getting TLE at test cases 5.

my submission:271274872

please suggest if there is any alternate approach this other than using dp.

Thanks