摘要:
DP or Greedy - they are all in O(n) In editorial, a beautiful Greedy solution is given: "To reach the last cloud in a minimum number of steps, always 阅读全文
posted @ 2016-07-21 09:31
Tonix
阅读(325)
评论(0)
推荐(0)
Tony's LogAlgorithms, Distributed System, Machine Learning |