POJ 3253:Fence Repair
2015-10-01 10:47
363 查看
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 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
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).
FJ想要把一段木头锯成他理想中的N段,每一段长度已知。但是锯每一段木头的开销就是木头的长度,我锯长度为21的木头,开销就是21,问想要锯成这样的N段,最小开销是多少?
优先队列,每次都取最小的两个值合并,然后再把改值放入队列中。不断循环,得到结果。
代码:
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 33114 | Accepted: 10693 |
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
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).
FJ想要把一段木头锯成他理想中的N段,每一段长度已知。但是锯每一段木头的开销就是木头的长度,我锯长度为21的木头,开销就是21,问想要锯成这样的N段,最小开销是多少?
优先队列,每次都取最小的两个值合并,然后再把改值放入队列中。不断循环,得到结果。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <queue> #include <string> #include <cstring> #pragma warning(disable:4996) using namespace std; int N; class cmp { public: bool operator()(int x, int y) { return x > y; } }; int main() { //freopen("i.txt","r",stdin); //freopen("o.txt","w",stdout); int i, temp1, temp2; long long ans = 0; priority_queue<int, vector<int>, cmp>qu; cin >> N; for (i = 1; i <= N; i++) { cin >> temp1; qu.push(temp1); } while (qu.size() != 1) { temp1 = qu.top(); qu.pop(); temp2 = qu.top(); qu.pop(); ans = ans + temp1 + temp2; qu.push(temp1 + temp2); } cout << ans << endl; return 0; }
相关文章推荐
- 机器学习岗位找工作记录帖-百度,大众点评offer到手
- Reverse Nodes in k-Group
- 谈谈JSON对象和字符串之间的相互转换JSON.stringify(obj)和JSON.parse(string)
- A Bug's Life
- AngularJS的Hello World
- 通过js获取上传的图片信息(临时保存路径,名称,大小)然后通过ajax传递给后端的方法
- JavaScript数据类型与运算符
- js跨域问题及解决方案
- 一、HTML和CSS基础--开发工具--Sublime前端开发工具技巧介绍
- NW.js入门学习
- js常见题目
- JavaScript控制元素CSS
- 回溯法Perfect Cubes
- 经典贪心算法(哈夫曼算法,Dijstra单源最短路径算法,最小费用最大流)
- Perfect Squares
- JSON对象和字符串之间的相互转换JSON.stringify(obj)和JSON.parse(string)
- hdu 5486 Difference of Clustering 2015多校联合训练赛
- javascript使用eventutil绑定事件
- JS处理json日期格式化问题
- JS日期格式化之javascript Date format