优先队列 poj3253 Fence Repair
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 51411 | Accepted: 16879 |
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
3
8
5
8
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条小木块,每一块长度为len的木板需要len的费用,求切完所有木板的费用之和的最小值
解题思路:本题的解法类似于哈夫曼编码,一直选用两块最小的相加,得到费用之和,本题用到了优先队列,本题要注意两点1.单独判断木板只有一个的情况,2.输出时费用之和要用long long类型的,否则会wrong answer
本题代码:
#include<queue>
#include<vector>
#include<stdio.h>
#include<iostream>
using namespace std;
int n;
long long sum;
int main(){
while(~scanf("%d",&n)){
sum=;
priority_queue<int,vector<int>,greater<int> >q;
for(int i=;i<n;i++){
int a;
scanf("%d",&a);
q.push(a);
}
if(q.size()==){
sum=q.top();
q.pop();
}
while(q.size()>){
int m,t;
m=q.top();
sum+=m;
q.pop();
t=q.top();
sum+=t;
q.pop();
q.push(m+t);
}
printf("%lld\n",sum);
}
return ;
}
笔记:优先队列
三种用法
第一种,直接使用默认的:
它的模板声明带有三个参数,priority_queue<Type, Container, Functional>
Type 为数据类型, Container 为保存数据的容器,Functional 为元素比较方式.
Container 必须是用数组实现的容器,比如 vector, deque(双向队列) 但不能用 list(链表).
STL里面默认用的是 vector. 比较方式默认用 operator< .
所以如果你把后面俩个参数缺省的话,优先队列就是大顶堆,队头元素最大.
priority_queue<int>Q;
Q.push();
Q.push();
Q.push();
Q.push();
cout<<Q.size()<<"\n";
while(!Q.empty())
{
cout<<Q.top()<<" ";
Q.pop();
}
输出:
4
4 3 2 1
第二种方法:(从小到大输出)
STL里面定义了一个仿函数 greater<>,对于基本类型可以用这个仿函数声明小顶堆
priority_queue<int, vector<int>, greater<int> >Q
priority_queue<int, vector<int>, greater<int> >Q;
Q.push();
Q.push();
Q.push();
Q.push();
cout<<Q.size()<<"\n";
while(!Q.empty())
{
cout<<Q.top()<<" ";
Q.pop();
}
输出:
4
1 2 3 4
第三种,自定义类型:
重载 operator < 或者自己写仿函数
struct Node
{
int x;
int y;
Node() {};
Node(int a,int b)
{
x=a;
y=b;
}
}; bool operator < (Node a,Node b)
{
if(a.x==b.x)
return a.y>b.y;
return a.x>b.x;
} int main()
{
priority_queue<Node>q;
q.push(Node(,));
q.push(Node(,));
q.push(Node(,));
q.push(Node(,));
q.push(Node(,));
while(!q.empty())
{
Node node=q.top();
q.pop();
cout<<node.x<<" "<<node.y<<"\n";
}
return ;
}
输出:
1 1
1 2
2 7
3 4
5 6
也可以这么写
struct Node
{
int x;
int y;
Node() {};
Node(int a,int b)
{
x=a;
y=b;
}
const bool operator < (Node b)const
{
if(x==b.x)
return y>b.y;
return x>b.x;
}
};
还有重载()运算符
struct Node
{
int x;
int y;
Node() {};
Node(int a,int b)
{
x=a;
y=b;
}
};
struct cmp
{
bool operator () (Node a,Node b)
{
if(a.x==b.x)
return a.y>b.y;
return a.x>b.x;
}
};
优先队列 poj3253 Fence Repair的更多相关文章
- Poj3253 Fence Repair (优先队列)
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 67319 Accepted: 22142 De ...
- poj3253 Fence Repair【哈夫曼树+优先队列】
Description Farmer John wants to repair a small length of the fence around the pasture. He measures ...
- poj-3253 fence repair(贪心题)
题目描述: Farmer John wants to repair a small length of the fence around the pasture. He measures the fe ...
- poj3253 Fence Repair
http://poj.org/problem?id=3253 Farmer John wants to repair a small length of the fence around the pa ...
- POJ3253 Fence Repair(贪心)
分割木板的顺序是自由的,所以每次选择两块最短的板,组合在一起,增加队列,原来两个板出队,直到队列中为空或者仅仅剩下一个板时结束.这里使用优先队列较为方便. #include<iostream&g ...
- poj3253 Fence Repair(贪心+哈夫曼 经典)
https://vjudge.net/problem/POJ-3253 很经典的题,运用哈夫曼思想,想想很有道理!! 具体实现还是有点绕人,最后被long long卡了一下,看数据大小的时候单纯相乘了 ...
- POJ3253 Fence Repair【贪心】
我们的小伙伴Bingo真的很调皮,他在上课的路上看到树上有个鸟窝,他就想去把他捅下来,但是鸟窝很高他够不到,于是他就到处找木棍,想把这些木棍接在一起,然后去捅鸟窝.他一共找了N跟木棍 (1 ≤ N ≤ ...
- [POJ3253]Fence Repair(单调队列)
题目链接 http://poj.org/problem?id=3253 题目描述 大意:切长度为a的木条的花费是a,给定最终切好的n段各自的长度,问由原来的一根木条(长度为n段长度和)以最终总花费最小 ...
- POJ 3253 Fence Repair (优先队列)
POJ 3253 Fence Repair (优先队列) Farmer John wants to repair a small length of the fence around the past ...
随机推荐
- java多线程开发容易犯的错误
昨天在社区上看到有人讨论多线程使用,多线程遇到一些问题以及一些使用技巧记录一下.为什么要使用多线程, 不能是为了用而用,和设计模式一样用的合理,会让程序更易于理解,用的不合理反而会让程序变得更难理解. ...
- King
King Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submissi ...
- sersync实现数据实时同步
1.1 第一个里程碑:安装sersync软件 1.1.1 将软件上传到服务器当中并解压 1.上传软件到服务器上 rz -E 为了便于管理上传位置统一设置为 /server/tools 中 2.解压软件 ...
- 修改文件的所有者失(chown: changing ownership of `uploads': Operation not permitted)
在项目开发的时候,经常需要将文件上传到指定的目录下. 例如这次用thinkphp5的时候,需要在public目录下建立uploads目录用于存放上传的资源. 首先在命令窗口下输入: mkdir upl ...
- java读写锁ReadWriteLock
package com.java.concurrent; import java.util.concurrent.locks.ReadWriteLock; import java.util.concu ...
- Nginx Location 匹配
location匹配命令 ~ #波浪线表示执行一个正则匹配,区分大小写~* #表示执行一个正则匹配,不区分大小写^~ #^~表示普通字符匹配,如果该选项匹配,只匹配该选项,不匹配 ...
- 算法:JavaScript两数之和
题目 Given an array of integers, return indices of the two numbers such that they add up to a specific ...
- 安装MongoDB启动时报错‘发生系统错误2’的解决办法
安装数据库mongodb启动时报"发生系统错误2". 这个问题是如果你之前已经装过一次,并且两次安装目录不同,就绝对会碰到的,因为你之前安装的路径已经在注册表中生成了,并没有随着你 ...
- ubuntu server小技巧(不定期更新)
0.常用工具apt安装包名 # ssh服务器工具 apt-get install openssh-server # RabbitMQapt-get install rabbitmq-server # ...
- How To Use Linux epoll with Python
http://scotdoyle.com/python-epoll-howto.html Line 1: The select module contains the epoll functional ...