General approach for optimisation problems in competitive programming
Hi, I have just started out with competitive programming. I am solving problems from previous ZCO papers.
I noticed that a lot of the problems are related to maximising and minimising the total score. I am having a hard time solving these questions. I would like to know if there was any general approach in solving such problems.
An example of such problem if IPL from ZCO(India) 2014.