A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck’s fuel tank. The truck now leaks one unit of fuel every unit of distance it travels.
To repair the truck, the cows need to drive to the nearest town (no more than 1,000,000 units distant) down a long, winding road. On this road, between the town and the current location of the truck, there are N (1 <= N <= 10,000) fuel stops where the cows can stop to acquire additional fuel (1…100 units at each stop).
The jungle is a dangerous place for humans and is especially dangerous for cows. Therefore, the cows want to make the minimum possible number of stops for fuel on the way to the town. Fortunately, the capacity of the fuel tank on their truck is so large that there is effectively no limit to the amount of fuel it can hold. The truck is currently L units away from the town and has P units of fuel (1 <= P <= 1,000,000).
Determine the minimum number of stops needed to reach the town, or if the cows cannot reach the town at all.
一群奶牛抢了一辆卡车决定前往树林里探险。但是由于他们的驾驶技术太糟，油箱在路上弄破了，所以他们每前进一个单位的路程就会漏掉一个单位的油。为了修好油箱，奶牛们必须前往最近的城市（不会超过1000000单位路程）。在当前位置和城市之间有N个加油站，奶牛可以在加油站加1到100单位的油。
对于人来说，树林是危险的地方，对奶牛来说，更是这样，所以奶牛门尽可能的少停站加油，幸运的是，这辆卡车的油箱非常大，你可以认为它的容量是无限大的。卡车在离城市P单位时还有L个单位的油。
你要计算出奶牛们至少要停几站才能到城市，或者奶牛们根本到不了城市。
代码a=[10,14,20,21] b=[10,5,2,4] n=4;l=25;p=10 c=[] k=1;i=0 num=0 while i
