Help in Maintenance Planning (https://training.olinfo.it/#/task/ois_machine/statement)
Hi! I recently tried to solve Maintenance Planning problem, but I cannot figure out how to resolve the last subtask. Basically, my solution is a dp[i] that represents the minimum price that I have ...