poj3253 Fence Repair(哈弗曼)
来源:互联网 发布:淘宝买家具哪个品牌好 编辑:程序博客网 时间:2024/06/07 22:55
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
Lines 2..N+1: Each line contains a single integer describing the length of a needed plank
Output
Sample Input
3858
Sample Output
34
Hint
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).
Source
/*不用long long 会wa 加油!!Time:2014-12-5 7:26*/#include<cstdio>#include<queue>#include<vector>using namespace std;const int INF=1<<28;#define LL long longpriority_queue<int,vector<int>,greater<int> >pq;int main(){int n;while(scanf("%d",&n)!=EOF){int val;while(!pq.empty())pq.pop();for(int i=0;i<n;i++){scanf("%d",&val);pq.push(val);}LL ans=0;while(pq.size()>1){int a=pq.top();pq.pop();int b=pq.top();pq.pop();ans+=a+b;pq.push(a+b);}//ans+=pq.top();printf("%lld\n",ans);}return 0;}
- poj3253 Fence Repair(哈弗曼)
- POJ3253 Fence Repair(huffman)
- poj3253 Fence Repair (优先队列)
- poj3253——Fence Repair(哈夫曼)
- POJ3253 Fence Repair(贪心,哈夫曼树)
- POJ3253 Fence Repair
- poj3253 Fence Repair( 贪心 )
- poj3253 Fence Repair
- poj3253 Fence Repair
- poj3253 Fence Repair---赫夫曼树
- poj3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253 Fence Repair
- POJ3253--Fence Repair
- POJ3253 Fence Repair(贪心)
- POJ3253 Fence Repair
- poj3253 Fence Repair
- Poj3253—Fence Repair
- python杂记
- 机器视觉开源处理库汇总-介绍n款计算机视觉库/人脸识别开源库/软件 -几种图像处理类库的比较-视觉相关网站
- 2014年7月7日星期一(DEMO8-7使用新的模型格式)
- 转载:Why does MYSQL higher LIMIT offset slow the query down?
- 2014年7月8日星期二(DEMO8-8加载3DSMAX ASCII格式模型.ASC)
- poj3253 Fence Repair(哈弗曼)
- win7下VC++6.0打开多个工作区间
- 2014年8月26日星期二(DEMO8-9加载COB模型)
- 机器视觉专题
- [LeetCode] Balanced Binary Tree 平衡二叉树
- 9-2加上光照计算的GOURAUD shader多边形)
- 去学隐身术吧
- 前端开发神器 Emmet 介绍
- 使用 Emmet 生成 HTML 的语法详解