ACM-优先队列&哈夫曼树
寻找星空的孩子
CSDN博客首页:http://blog.csdn.net/u010579068?viewmode=list
博客园地址:http://www.cnblogs.com/yuyixingkong/
展开
-
优先队列使用方法
#include<iostream> #include<functional> #include<queue> using namespace std; struct node { friend bool operator< (node n1, node n2) { return n1.priority < n2.priority; } int pri转载 2015-04-04 20:45:49 · 575 阅读 · 0 评论 -
SG Value
SG Value Time Limit: 5 Sec Memory Limit: 256 MB Submit: 163 Solved: 45 [Submit][Status][Web Board] Description The SG value of a set (multiset) is the minimum positive integer that could no原创 2015-04-04 21:37:07 · 831 阅读 · 0 评论 -
2015 Multi-University Training Contest 6 solutions BY ZJU(部分解题报告)
2015 Multi-University Training Contest 6 solutions原创 2015-08-07 13:47:58 · 1267 阅读 · 1 评论