算法整理 & 复习：堆

洛谷博客

---

一、大顶堆

void Insert(int x){
	heap[++heapSize] = x;
	int u = heapSize;
	int fa = u>>1;
	while(fa > 0){
		if(heap[u] <= heap[fa]) return;
		swap(heap[u],heap[fa]);
		u = fa;
		fa >>= 1;
	} 
}

void Delete(){
	swap(heap[1],heap[heapSize--]);
	int fa = 1;
	int u = fa<<1;
	while(u <= heapSize){
		if((u|1)<=heapSize && heap[u|1]>heap[u]) u++;
		if(heap[fa] >= heap[u]) return;
		swap(heap[fa],heap[u]);
		fa = u;
		u <<= 1;
	}
}

---

二、小顶堆

P3378 【模板】堆

#include <stdio.h>
#include <iostream>
using namespace std;
#define MAXN 1000005

int heap[MAXN];
int n,op,num,heapSize;

void Insert(int x){
	heap[++heapSize] = x;
	int u = heapSize;
	int fa = u>>1;
	while(fa > 0){
		if(heap[u] >= heap[fa]) return;
		swap(heap[u],heap[fa]);
		u = fa;
		fa >>= 1;
	} 
}

void Delete(){
	swap(heap[1],heap[heapSize--]);
	int fa = 1;
	int u = fa<<1;
	while(u <= heapSize){
		if((u|1)<=heapSize && heap[u|1]<heap[u]) u++;
		if(heap[fa] <= heap[u]) return;
		swap(heap[fa],heap[u]);
		fa = u;
		u <<= 1;
	}
}

int main(void){
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> op;
		switch(op){
			case 1:
				cin >> num;
				Insert(num);
				break;
			case 2:
				cout << heap[1] << endl;
				break;
			case 3:
				Delete();
				break;
		}
	}
	return 0;
}

---

返回