The only important thing to do is to simulate Mislav's movement and food consumption if he starts his journey from every possible position and decides to start eating from that point. When he starts eating, he will eat a fruit if it can fit inside his stomach, otherwise he will not eat it and continue trying to eat other fruits. Therefore, we need to calculate how much fruit he will eat if he starts eating from the fruit on that position, from every position. The maximal obtained number is the solution. The total complexity of this solution is ~\mathcal O(n^2)~.