poj 3253 Fence Repair(哈夫曼树)
来源:互联网 发布:2016网络广告公司排名 编辑:程序博客网 时间:2024/05/16 07:26
点击打开题目链接
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer lengthLi (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN 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 theN-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
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).
STL优先队列实现;
#include <iostream>#include<stdio.h>#include<queue>#define MAX 20010using namespace std;typedef long long LL;struct cmp1{ friend bool operator <(const cmp1 &a,const cmp1 &b) { return a.m>b.m;//最小值优先 } LL m;};int main(){ int i; LL n; cmp1 num; priority_queue<cmp1> p; while(~scanf("%I64d",&n)) { for(i=1; i<=n; i++) { scanf("%I64d",&num.m); p.push(num); } LL ans=0; while(p.size()>1) { cmp1 a,b; a=p.top(); p.pop(); b=p.top(); p.pop(); ans+=a.m+b.m; cmp1 c; c.m=a.m+b.m; p.push(c); } printf("%I64d\n",ans); } return 0;}
非STL实现:
#include <iostream>#include<stdio.h>#define MAX 20010using namespace std;typedef long long LL;LL p[MAX];LL n,len;void heap_insert(LL k)///堆插入{ long t=++len; p[t]=k; while(t>1) { if(p[t/2]>p[t]) { swap(p[t],p[t/2]); t/=2; } else break; }}void heap_pop()///堆删除{ long t=1; p[t]=p[len--]; while(t*2<=len) { long k=t*2; if(k<len&&p[k]>p[k+1]) ++k; if(p[t]>p[k]) { swap(p[t],p[k]); t=k; } else break; }}int main(){ int i; while(~scanf("%I64d",&n)) { for(i=1;i<=n;i++) { scanf("%I64d",&p[i]); } len=0; for(i=1;i<=n;i++) { heap_insert(p[i]); } LL ans=0; while(len>1) { LL a,b; a=p[1]; heap_pop(); b=p[1]; heap_pop(); ans+=a+b; heap_insert(a+b); } printf("%I64d\n",ans); } return 0;}
- 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
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- POJ 3253Fence Repair
- POJ--3253 -- Fence Repair
- poj-3253-Fence Repair
- POJ 3253 Fence Repair
- 链接,转载与库:关于程序装载入内存的一些小实验
- ibatis中传递多个参数
- 珠海SEO 告诉你如何聘请好的SEO公司
- 在Delphi中很精确地控制生成的WORD文档的格式
- iOS 17个常用代码整理
- poj 3253 Fence Repair(哈夫曼树)
- 高效使用你的Xcode
- vc线程、信号量、Event对象的使用
- 顶级葫芦VPN
- strstr函数
- 【linux入门学习之】介绍Linux重定向的使用(一)
- 顶级品质的最佳葫芦在Xbox 360上的VPN
- 最让程序员懊恼的 10 件事
- 采用德国VPN访问社交网站