Lowest fuel cost issue greedy algorithms

后端 未结 0 1435
臣服心动
臣服心动 2021-01-14 20:51

Started learning about greedy algorithms and this question came up. Basically, a fuel tank can hold 200km of gas and it moves from fuel station 1 to fuel station N. In betwe

相关标签:
回答
  • 消灭零回复
提交回复
热议问题