POJ 3253 Fence Repair (霍夫曼编码 + 最小堆)

最新推荐文章于 2022-11-27 08:10:31 发布

原创最新推荐文章于 2022-11-27 08:10:31 发布 · 462 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#POJ #3253 #Fence Repair #霍夫曼 #最小堆

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章

订阅专栏

ACM-ICPC

154 篇文章

订阅专栏

本文介绍了一个使用最小生成树算法解决木板连接问题的C语言实现。通过构建一个最小堆并对木板长度进行操作，该程序可以有效地计算出连接所有木板所需的最低成本。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#define MAX_PLANKS 20000

int numOfPlanks;
long long length[MAX_PLANKS + 1];
int heapSize;

void swap(long long  *a, long long *b){
	long long c = *a;
	*a = *b;
	*b = c;
}

int getParent(int child){
	return child >> 1;
}

int leftChild(int parent){
	return parent << 1;
}

int rightChild(int parent){
	return (parent << 1) + 1;
}

void minHeapify(int parent){
	int smallest = parent;
	int left = leftChild(parent);
	if (left <= heapSize &&  length[left] < length[smallest])
		smallest = left;
	int right = rightChild(parent);
	if (right <= heapSize && length[right] < length[smallest])
		smallest = right;
	if (smallest != parent){
		swap(&length[smallest], &length[parent]);
		minHeapify(smallest);
	}
}

void buildMinHeap(){
	int parent;
	for (parent = heapSize >> 1; parent >= 1; parent--)
		minHeapify(parent);
}

long long extractMin(){
	long long min = length[1];
	length[1] = length[heapSize];
	heapSize--;
	minHeapify(1);
	return min;
}

void insert(long long len){
	heapSize++;
	length[heapSize] = len;
	int index = heapSize;
	int parent;
	while (( parent = getParent(index) ) >= 1 && length[parent] > length[index]){
		swap(&length[index], &length[parent]);
		index = parent;
	}
}

int main(){
	
	scanf("%d", &numOfPlanks);
	int i;
	for (i = 1; i <= numOfPlanks; i++)
		scanf("%d", &length[i]);

	heapSize = numOfPlanks;
	buildMinHeap();

	long long one, another;
	long long minCost = 0;
	while (heapSize > 1){
		one = extractMin();
		another = extractMin();
		minCost += one + another;
		insert(one + another);
	}

	//注意输出long long 要用 %lld
	printf("%lld\n", minCost);

	return 0;
}