Company: Walmart_12march
Difficulty: medium
Minimum Stops Problem Description You're going on a road trip in an electric car. The car's battery starts fully charged with a capacity of C units and a time limit of T units, and you have a certain amount of time to reach your destination. There are charging stations along the way, but they might be busy. If a station is busy (value=0), you can't charge there and have to wait or move on to the next one. If it's not busy (value>0), you can charge your car there. Every time you stop to charge, it takes extra time which adds an overhead of Y time where Y is the position where it stopped to charge. This extra time is equal to the number of stops you've made so far. Your goal is to make as few stops as possible, while making sure you reach your destination within the time limit. You also have to consider that some charging stations might be busy. Input Format The first line contains a single integer number representing the total distance to be covered. The second line contains a single in