POJ 3253 Fence Repair
来源:互联网 发布:ff14拉拉菲尔捏脸数据 编辑:程序博客网 时间:2024/06/07 06:48
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).
题意:
有一根木板,切成 n 块,已知最终每块木板长度,求最小花费。每次花费为本次所切木板长度。
分析:
最小花费即每次都切成两个最小长度,例如有长度分别为 6,5,7,4,2 的木板,则最后一次切的长度为 6,切成了4,2。本次未切之前木板为6,5,7,6,同理,倒数第二次未切之前为
11,7,6.倒数第三次未切之前为11,13.总长为24.共花费54.
用优先队列保存每块木板长度,每次从头部取两个最小长度,求和,累加,再加入队列。。。
代码如下:
#include<cstdio>#include<iostream>#include<queue>using namespace std;int main(){ priority_queue<int, vector<int>, greater<int> > q; //由小到大的优先队列,头部最小 int n, m; while(cin >>n) { while(!q.empty()) //清空队列 q.pop(); while(n--) { scanf("%d", &m); q.push(m); //加入队列 } long long s = 0; //数据太大,int就WA了 while(q.size() > 1) { int k = q.top(); //先从头部取一个 q.pop(); //除去头部元素 k += q.top(); //再从头部取一个,次头为上一个头下面的元素 q.pop(); s += (long long)k; q.push(k); //将两最小值的和加入队列 } cout <<s <<endl; } 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 3253Fence 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
- 游戏开发(三)——WIN32 黑白棋(一)——棋局逻辑的设计
- 数据结构和算法设计专题之---求子数组和的最大值
- Python中的psutil:一个用于获得处理器和系统相关信息的模块
- 【map<s,i>】#42 A. Football
- ios 知识小积累
- POJ 3253 Fence Repair
- 阿斯顿国际化的规划地方和地方干活
- design pattern - memento
- 我的架构经验系列文章 - 后端架构 - 安全层面
- 我的架构经验系列文章 - 后端架构 - 性能层面
- C#入门之变量篇
- python爬虫自动搜索下载游民今日搞笑图集
- java开发中的那些事(4)-------没完没了的time of error
- Oracle Goldengate实现插入记录的当前时间