堆
请多指教^_^
这个作者很懒,什么都没留下…
展开
-
Binary Search Heap Construction (笛卡尔树)
Binary Search Heap Construction 题目链接 Time Limit: 2000MS Memory Limit: 30000K Description Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes原创 2020-11-03 23:40:20 · 232 阅读 · 0 评论 -
二叉堆实现优先队列(大根堆、小根堆)
大根堆 大根堆是根节点比其儿子结点值要大的二叉堆,故优先队列的队首数值是最大的。具体实现见代码: #include<iostream> #include<cstdio> using namespace std; const int maxn = 1000; class Priority_queue //大根堆,优先队列 { public: int heap[maxn], tot; Priority_queue(); ~Priority_queue(); void原创 2020-10-20 16:50:16 · 384 阅读 · 0 评论