摘要：
Very nice DP problem. The key fact of a mutual-divisible subset: if a new number n, is divisible with the largest number m within a mutual-divisible s 阅读全文
posted @ 2016-06-27 13:20
Tonix
阅读(344)
评论(0)
推荐(0)
摘要：
Typical DFS problem. Simply get higher height and push_back. 阅读全文
posted @ 2016-06-27 11:35
Tonix
阅读(167)
评论(0)
推荐(0)
摘要：
Typical binary search.. but take care of data overflow if you are using C++ 阅读全文
posted @ 2016-06-27 11:21
Tonix
阅读(186)
评论(0)
推荐(0)
浙公网安备 33010602011771号