Fence Repair POJ 3253
2015-08-26 09:19
489 查看
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).
运用优先队列+long long,数据最大肯定比20000*50000大,WA了一次才知道。
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).
运用优先队列+long long,数据最大肯定比20000*50000大,WA了一次才知道。
#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> #include<queue> using namespace std; int main() { priority_queue <int,vector<int>,greater<int> >q; int n; int a[20010]; cin>>n; for(int i=0; i<n; i++) { cin>>a[i]; q.push(a[i]); } int x,y,ans; long long sum=0; while(!q.empty()) { x=q.top(); q.pop(); if(q.empty()==true) { break; } y=q.top(); q.pop(); ans=x+y; sum+=ans; q.push(ans); } printf("%lld\n",sum); return 0; }
相关文章推荐
- JS面向对象概述
- hibernate3第四章之一对多cascade、fetch
- 15-07-27 HTML-样式-格式与布局
- POJ-2796-Feel Good-萌萌的单调栈
- 基于服务器时间的倒计时功能js
- js基于服务器时间的倒计时功能
- 前端构建工具gulpjs的使用介绍及技巧
- js基于服务器时间的倒计时功能
- jQuery 遍历 json 方法大全
- HTML 5 Web 存储提供了几种存储数据的方法
- javascript中alert()与console.log()的区别
- 静态分析中”Potential null dereference”的处理
- 验证整数、小数、实数、有效位小数最简单JavaScript正则表达式
- Buffer创始人谈开发:先验证,后开发!
- JQuery Mobile 简单入门引导
- jQuery的deferred对象详解
- jQuery如何实现点击页面获得当前点击元素
- HTML5 Introduction
- 集群环境下JSP中获取客户端IP地址的方法
- [ACdream 1211 Reactor Cooling]无源无汇有上下界的可行流