摘要：It is a super interesting problem - it's not about the algorithm SKILLs, it is about algorithm THINKING. In this problem, the goal is actually to have 阅读全文

摘要：Interesting constructive solution. My first reaction was 0-1 Knapsack and I believe it'll work. But you don't have to use it. Think about the min sum 阅读全文

摘要：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 阅读全文

摘要：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. 阅读全文

摘要：This is an educational one to Game Tree + Minimax - sounds fancy but actually it is intuitive DFS process. And Simplified Chess Engine II is an variat 阅读全文