最长单调子序列、字符串比较、加油问题及背包问题的算法分析及求解-The longest monotone subsequence, string comparison, the fuel problem and knapsack problem analysis and solving algorithms

使用贪心法实现最优加油问题，给定距离可加油站的位置及距离，确定加油站的次序！-Using the greedy method to achieve optimal fuel problem, given the location and distance from the station to determine the order of the gas station!

【汽车加油问题】一辆汽车加满油后可以行驶N千米。旅途中有若干个加油站。若要使沿途的加油次数最少，设计一个有效的算法，指出应在那些加油站停靠加油。并证明你的算法能产生一个最优解。-[Problem] auto fuel fill up a car after driving N km. There are several gas stations journey. To make the least number of refueling along the way to design an ef