poj-3253Fence Repair(优先对列 求木棍的最小和)
来源:互联网 发布:ambari web 源码编译 编辑:程序博客网 时间:2024/06/06 04:12
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
#include<iostream>#include<string>#include<cstring>#include<queue>#include<cstdio>#include<vector>using namespace std;int n;int a[20005];int main(){while(~scanf("%d",&n)){memset(a,0,sizeof(a));for(int i=0;i<n;i++)scanf("%d",&a[i]);priority_queue<int,vector<int>,greater<int> > que;for(int i=0;i<n;i++){que.push(a[i]);}long long sum=0;while(que.size()>1){long long p,q;p=que.top();que.pop();q=que.top();que.pop();sum+=p+q;que.push(p+q);}printf("%lld\n",sum);}return 0;}
- poj-3253Fence Repair(优先对列 求木棍的最小和)
- POJ 3253 Fence Repair (优先队列)
- POJ 3253 Fence Repair(优先队列)
- POJ 3253 Fence Repair(优先队列)
- 【POJ】-3253-Fence Repair(优先队列)
- POJ:3253 Fence Repair(优先队列)
- Fence Repair(优先队列) POJ 3253
- POJ 3253 Fence Repair 堆的应用,优先队列
- Poj 3253 Fence Repair (贪心加优先队列的应用)
- poj 3253 Fence Repair (贪心+哈弗曼思想+优先队列)
- poj 3253 Fence Repair (STL优先队列)
- poj 3253 Fence Repair(Huffman问题,优先队列priority_queue)
- poj 3253 Fence Repair(优先队列+哈夫曼树)
- POJ 3253 Fence Repair 题解(优先队列实现哈夫曼树)
- POJ 题目3253 Fence Repair(优先队列,哈弗曼)
- poj-3253-Fence Repair-优先队列(哈夫曼树)
- 贪心+优先队列(哈夫曼思想)POJ 3253 Fence Repair
- POJ——3253 Fence Repair(优先队列)
- 解决MyEclipse中安装或升级ADT之后SDK Target无法显示的问题
- .NET全栈开发工程师
- 面试知识点集合
- animation在手机上直角坐标系,即动画移动的轴
- VB6存取UTF-8文件
- poj-3253Fence Repair(优先对列 求木棍的最小和)
- C++ 为什么析构函数不能抛出异常
- LightOJ 1078
- [Python]网络爬虫(二):利用urllib2通过指定的URL抓取网页内容
- composer的安装与使用
- Java 8: Streams API
- Aizu 0189
- Educational Codeforces Round 15(简单题)
- POJ 2377