poj3253 哈弗曼树 小根堆
来源:互联网 发布:淘宝鸿星尔克 编辑:程序博客网 时间:2024/05/17 03:48
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).
#include<iostream>using namespace std;__int64 n,p[20005],len,k,ans=0,a,b;void add(__int64 x){ k=++len; p[k]=x; while(k>1){ if(p[k/2]>p[k]){ swap(p[k/2],p[k]); k/=2; } else break; }}void dele(void){p[1]=p[len--];k=1;while(k*2<=len){__int64 t=k*2;if(t<len&&p[t]>p[t+1]) t++;if(p[k]>p[t]){swap(p[k],p[t]);k=t;}else break;}}int main(){cin>>n;for(__int64 i=1;i<=n;i++)cin>>p[i];len=0;for(__int64 i=1;i<=n;i++) add(p[i]);while(len>1){a=p[1];dele();b=p[1];dele();ans+=a+b;add(a+b);} cout<<ans<<endl; return 0;}
- poj3253 哈弗曼树 小根堆
- poj3253
- POJ3253
- poj3253
- poj3253
- poj3253
- poj3253
- POJ3253
- poj3253
- POJ3253
- poj3253
- poj3253
- POJ3253
- poj3253
- poj3253
- poj3253
- poj3253
- poj3253
- JVM调优设置
- sqlserver insert 触发器
- POJ 3735 Training little cats 解题报告(矩阵构造+快速幂优化)
- android的签名 命令改密码等
- SQL的一些小问题
- poj3253 哈弗曼树 小根堆
- c++之模板
- Filter过滤器,统一网站字符编码
- Struts入门基础应用
- Android中Dalvik和JVM的区别是什么?
- [SHTSC 2012] 信用卡凸包
- Android平台APK分析工具包androguard的部署使用和原理分析
- 建立三层结构的ASP应用程序
- Building decision trees to identify the intent