Tony's Log

Algorithms, Distributed System, Machine Learning

  博客园 :: 首页 :: 博问 :: 闪存 :: 新随笔 :: 联系 :: 订阅 订阅 :: 管理 ::

2018年1月16日

摘要: Key points for this one: - Relate the comparison process to BST search- Reasoning on extreme values: "We can notice that for a fixed the maximum sum o 阅读全文
posted @ 2018-01-16 13:53 Tonix 阅读(177) 评论(0) 推荐(0) 编辑

摘要: Key point of this problem is "New subsets are the all old subsets having a[i]." - A very useful trick. After that, it'll simply be a DP one. 阅读全文
posted @ 2018-01-16 10:57 Tonix 阅读(114) 评论(0) 推荐(0) 编辑