Poj-3253-Fence Repair ( 哈夫曼
2017-06-10 00:34
363 查看
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 planksLines 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 cutsSample Input
38
5
8
Sample Output
34Hint
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).
题意
给需求的板子数 加起来进行切割 每切割一次需要的价值是他的长度题解:
get一个新技能 哈夫曼思想AC代码
#include <queue> #incl 4000 ude <cstdio> #include <iostream> #include <algorithm> using namespace std; typedef long long LL; int main() { int n; while(cin>>n) { int x, a, b, c; LL sum = 0; priority_queue<int, vector<int>, greater<int> > fq; for(int i = 0;i < n; i++) { cin>>x; fq.push(x); } if(fq.size()==1) { sum += fq.top(); fq.pop(); } while(fq.size() > 1) { a = fq.top(); fq.pop(); b = fq.top(); fq.pop(); c = a+b; sum += c; fq.push(c); } cout<<sum<<endl; } return 0; }
相关文章推荐
- POJ-3253--Fence Repair(简单哈夫曼的应用)
- poj 3253 Fence Repair(哈夫曼)
- poj 3253 Fence Repair (哈夫曼)
- poj3253——Fence Repair(哈夫曼)
- poj 3253 Fence Repair 数据结构(哈夫曼数)
- POJ 3253 Fence Repair(哈夫曼)
- 文章标题 POJ 3253 : Fence Repair(哈夫曼)
- 贪心+优先队列(哈夫曼思想)POJ 3253 Fence Repair
- poj-3253-Fence Repair(哈夫曼)
- POJ 3253 Fence Repair (哈夫曼)
- poj 3253 Fence Repair(哈夫曼+二叉堆)
- POJ 3253 Fence Repair(哈夫曼)
- poj 3253 Fence Repair 哈夫曼最优解STL解法
- poj 3253 Fence Repair(优先队列+哈夫曼树)
- POJ 3253 Fence Repair 堆的应用,优先队列
- POJ 3253 Fence Repair(优先队列,哈夫曼树,模拟)
- POJ 3253 Fence Repair 哈夫曼树/优先级队列
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair 霍夫曼树 贪心 优先队列
- POJ 3253 Fence Repair