摘要：
这是系统复习动态规划 (Dynamic Programming, DP)的第一篇随笔. 以 "Codeforces 711 C coloring trees" 为例, 总结一下DP的基础知识. time limit per test 2 seconds memory limit per test 2 阅读全文
「以解决问题为乐」
真的喜欢么？真的喜欢就去做吧。
Lost Boy Calling 。。。。
... Many of these issues are best dealt with at the algorithmic level, rather than by "tweaking" the code.
This is an obscurity that catches the unwary.
原来我什么都不懂。