poj 3253 Fence Repair (哈夫曼)
2014-04-11 21:00
483 查看
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 theN 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).
Source
USACO 2006 November Gold
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 23532 | Accepted: 7491 |
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 theN 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
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).
Source
USACO 2006 November Gold
//596K 16MS C++ 610B //哈夫曼水题 #include<iostream> #include<algorithm> #include<queue> using namespace std; int main(void) { __int64 n,p[20005]; while(scanf("%I64d",&n)!=EOF) { priority_queue<__int64,vector<__int64>,greater<__int64> >Q; for(int i=0;i<n;i++){ scanf("%I64d",&p[i]); Q.push(p[i]); } __int64 sum=0; while(Q.size()>1){ int a=Q.top(); Q.pop(); int b=Q.top(); Q.pop(); sum+=a+b; Q.push(a+b); } printf("%I64d\n",sum); } return 0; }
相关文章推荐
- js便签笔记(5)——Dean Edwards大牛的跨浏览器AddEvent()设计(不知道是不是jQuery事件系统的原型)
- Jqgrid -- search button doesn't work with Jquery 1.8.0 or greater
- Javascript的执行过程详细研究
- JSF笔记
- Chapter 1 unit 2 of Bootstrap-Bootstrap Scaffolding
- 函数改变全局变量-JS
- 【CSS】Intermediate2:Pseudo Classes
- 原生的javascript实现ajax技术
- 创建JavaScript对象
- 【CSS】Intermediate2:Grouping and Nesting
- Chapter 1 unit 1 of Bootstrap-Bootstrap Scaffolding
- 【CSS】Intermediate1:Class and ID Selectors
- JSP中include指令简介
- 一些非常有用的html,css,javascript代码片段(持久更新)
- JQuery 实现ajax 实例
- 深入理解JavaScript系列(43):设计模式之状态模式
- 如何成为一名优秀的web前端工程师(前端攻城师)?
- 使用NPM来管理你的Node.js依赖
- access转sqlite——利用DBManager professional软件
- JS数组的几个常用方法