本文主要是介绍POJ 3253Fence 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
3
8
5
8
Sample Output
34
这个没什么说的，就是哈弗曼编码的思想，要用到优先队列。
AC代码：
# include <cstdio>
# include <queue>
# include <algorithm>
using namespace std;
priority_queue<int, vector<int>, greater<int> > q;
int main(){long long int sum, num;int n;while(scanf("%d", &n)!=EOF){while(!q.empty()){q.pop();}sum=0;for(int i=1; i<=n; i++){scanf("%d", &num);q.push(num);}for(int i=1; i<=n-1; i++){num=q.top();q.pop();num=num+q.top();q.pop();sum=sum+num;q.push(num);}printf("%lld\n", sum);}return 0;
}
这篇关于POJ 3253Fence Repair的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
