POJ 3253 Fence Repair （哈夫曼）

POJ 3253 Fence Repair （哈夫曼）

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 Li (1 ≤ Li ≤ 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 Li). 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

3858

Sample Output

34

题意

FJ需要修补牧场的围栏，他需要 N 块长度为 Li

开始时，FJ只有一块无限长的木板，因此他需要把无限长的木板锯成 N 块长度为 Li

比如说测试数据 5 8 8，一开始，FJ需要在无限长的木板上锯下长度 21 的木板（5+8+8=21），第二次锯下长度为 5 的木板，第三次锯下长度为 8 的木板，至此就可以将长度分别为 5 8 8 的木板找出。

思路

既然最终要找的是长度为 Li 的 N

首先假设我们有长度为5 8的两根木头，那它是由长度为13的木头得来的，于是，此时便有了长13 8的两根木头，同样，它是由长21的木头得来的，于是最终的最小花费为 13+21=34

哈夫曼问题，总是选取最小的两个，然后组合之后加入队列，当到达树的顶端时，组合完毕，输出路径中各组合节点的和。

AC 代码

#include #include#include#include#include

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。