搜索资源列表
addingoil
- 一辆汽车加满油后可行使N公里,旅途中有若干个加油站,使沿途加油次数最少-a fully-fueled vehicles that can be exercised after the N-km journey, a number of filling stations along the least number of refueling
stones6ok
- Problem F:汽车加油 Time Limit:1000MS Memory Limit:65536K Total Submit:1400 Accepted:404 Language: not limited Descr iption 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少。 编程任务: 对于给定的n和k(k <= 10000)个加油站位置,编程
cargas
- ACM里面一条cargas题目,就是汽车加油题目,如何对加油站进行选择才可以获得加油次数最少,而同时有可以完成要行驶路程的目标。
jiayouzhanwenti
- 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少。对于给定的n和k个加油站位置,编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to
qichejiayou
- 一辆汽车加满油后可行驶n公里,旅途中有若干个加油站,设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少,对于给定的n和k个加油站位置,编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题,也就是所求问题的整体最优解可以通过一系列局部最优的选择,即贪心选择来达到。这是贪心选择算法可行的第一个基本要素,也是贪心算法与动态规划算法的主要区别。在动态规划算法中,每步所做的选择往往信赖于相关子问题的解,因而只有在解出相关子问题后,才能做出选择。而在贪心算法中仅在当前状态下做出最
automotive
- 汽车加油问题具有选择性的贪心算法。汽车每经过一个加油站,是否需要加油!还是等到下一个加油站再加满油。-Automotive refueling.
shiyan4
- 使用贪心法实现最优加油问题,给定距离可加油站的位置及距离,确定加油站的次序!-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!
test7
- 贪心算法解决汽车加油问题。。 一辆汽车加满油后可以行驶N千米。旅途中有若干个加油站。若要使沿途的加油次数最少,设计一个有效的算法,指出应在那些加油站停靠加油。并证明你的算法能产生一个最优解。-Greedy algorithm to solve vehicle refueling. . Fill up a car after driving N km. There are several gas stations journey. To make the least number of refue
jiayou
- 假定你开去香格里拉。出发前油箱是满的,可以行驶D公里。路上一共有n个加油站,A[i]表示从第i-1加油站到第i个的距离。最后一个加油站在香格里拉。请设计算法帮助驾驶员选择加油站使加油的次数最少-Suppose you go through Shangri-La. Tank is full before departure, can travel D km. On the road a total of n stations, A [i] that from the first i-1 i-sta
jiayouzhanwenti
- VC++编写的完整的加油站问题的代码,代码简单易懂,非常实用-Written in VC++ code to complete the gas station problem, is straightforward and very practical
jiayouzhan
- 【汽车加油问题】一辆汽车加满油后可以行驶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
gas
- 给定了n和k个加油站的位置,汽车加满油后可行驶n公里,指出应在哪些加油站停靠,使得加油次数最少,贪心选择算法-Can travel to the location given n and k gas stations, auto fill up n kilometers that should be docked in which gas stations, making refueling the least number of greedy selection algorithm
car
- 一辆汽车加满油后可行驶n 公里。旅途中有若干个加油站。设计一个有效算法,指出应在哪些加油站停靠加油,使沿途加油次数最少。并证明算法能产生一个最优解。-A fill up the car after running kilometers n. The journey with a plurality of gas station. The design of an efficient algorithm, point out should be in which gas station refue
qichejiayouwenti
- 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法,指出应 在哪些加油站停靠加油,使沿途加油次数最少。对于给定的n(n <= 5000)和k(k <= 1000)个加油站位置,编程计算最少加油次数。-Fill up the car after driving an n km. There are several gas stations journey. Design an efficient algorithm, which pointed out that
question
- 用贪心法求解,一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。(Use the greedy method to solve the problem of car refueling)