POJ 3253 Fence Repair（哈夫曼树）

最新推荐文章于 2021-07-26 11:36:28 发布

zxiaopp

最新推荐文章于 2021-07-26 11:36:28 发布

阅读量463

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/zxiaopp/article/details/49499669

版权

数据结构专栏收录该内容

11 篇文章 0 订阅

订阅专栏

Fence Repair

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 33710		Accepted: 10845

Description

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length L_i (1 ≤ L_i ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths L_i). FJ is ignoring the "kerf", the extra length lost to sawdust when a sawcut is made; you should ignore it, too.

FJ sadly realizes that he doesn't own a saw with which to cut the wood, so he mosies over to Farmer Don's Farm with this long board and politely asks if he may borrow a saw.

Farmer Don, a closet capitalist, doesn't lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.

Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.

Input

Line 1: One integer N, the number of planks
Lines 2.. N+1: Each line contains a single integer describing the length of a needed plank

Output

Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts

Sample Input

Sample Output

Hint

He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).

题意：一块木头要切成n段，每次切多长就要多少钱，问最少花费；

样例切三段，分别是8，5，8，可以先切13 和8，花费21，然后13切成8和5，花费13，就是34；

从下往上看就是哈夫曼树的构造，权值分别为8，5，8

分析：第一次做哈夫曼树，哈夫曼树的构造方法就是现在所有的数中找到最小的两个，相加的和放入原来的数中，然后在找和最小的两个数...直到还剩一个数，这样利用优先队列就很好的解决了，

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
//int a[20005];
int main()
{
    int n,temp;
    long long ans = 0;
    priority_queue<int,vector<int>,greater<int> > q;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &temp);
        q.push(temp);
    }
    while(q.size() > 1)
    {
        temp = q.top();
        q.pop();
        temp += q.top();
        ans += temp;
        q.pop();
        q.push(temp);
    }
    printf("%I64d\n",ans);

    return 0;
}