// 向最大堆中增加一个新的元素key void Max_Heap_Insert(int key) { ++heap_size; A[heap_size-1] = -MAX; Heap_Increase_Key(heap_size-1, key); }
void Priority_Queue::Max_Heap_Insert(int key) { Max_Heap.push_back(key); Number++; Heap_Increase_Key(Number-1,key); }
// 向最大堆中增加一个新的元素key void Max_Heap_Insert(int key) { ++heap_size; A[heap_size-1] = -MAX; Heap_Increase_Key(heap_size-1, key); }
void Priority_Queue::Max_Heap_Insert(int key) { Max_Heap.push_back(key); Number++; Heap_Increase_Key(Number-1,key); }