Company: Apple_1sep
Difficulty: medium
Optimize Pizza Delivery Routes Problem Description Mario's Pizza Palace has received N pizza orders for delivery, and they're all lined up in order of when they were received. Each pizza order has a different delivery time - the i th order will take A[i] minutes to deliver (including travel time to that location). Mario has B delivery drivers available for the evening shift. He needs to assign these orders to his drivers, but there are some important operational constraints: Route Efficiency: Each driver must take orders that are consecutive in the queue. A driver cannot skip orders in the middle - if they take order 1 and order 3, they must also take order 2. This ensures efficient route planning and prevents confusion. Everyone Works: Each driver must be assigned at least one delivery. Mario doesn't want any driver sitting idle while others are overworked. No Order Splitting: Each pizza order goes to exactly one driver. Mario wants to distribute the delivery orders in such a way that