摘要:树型DP + 可并堆 非常清楚的想到是树型DP, 但是如何维护最小值, 于是就去新学了可并堆 cpp include include include include include define ll long long using namespace std; const int MAXN = 1 阅读全文
posted @ 2018-04-27 21:20 Mr_Wolfram 阅读 (53) 评论 (1) 编辑
摘要:可并堆,就是可以合并的堆 注意并查集不能路径压缩,不然删除根节点时会出错 cpp include include include include include include using namespace std; const int MAXN = 105005; int init() { in 阅读全文
posted @ 2018-04-27 20:03 Mr_Wolfram 阅读 (46) 评论 (2) 编辑