poj 3253 Fence Repair 优先队列

原创 2015年07月10日 00:24:00
Fence Repair
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 30810   Accepted: 9949

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

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).

Source

有一块长木板,要经过n-1次切割将其切成n块FJ想要的木板,对于每块木板,没切割一次,将会消耗和这条木板长度值相等的金钱,问最少需要多少钱,可将木板切成自己想要的n块
优先队列
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
class cmp
{
public:
    bool operator()(const __int64 a,const __int64 b)const
    {
        return a>b;
    }
};
int main()
{
	int n;
	while(cin>>n)
	{
		priority_queue<long long ,vector<long long>,cmp> q;
		for(int i=1;i<=n;i++)
		{
			long long t;
			cin>>t;
			q.push(t);
		}
		long long sum=0;
		while(q.size()>1)
		{
			long long a=q.top();
			q.pop();
			long long b=q.top();
			q.pop();
			q.push(a+b);
			sum+=a+b;
		}
		cout<<sum<<endl;
		while(!q.empty())
		{
			q.pop();
		}
	}
	return 0;
}





相关文章推荐

poj 3253 Fence Repair(Huffman问题,优先队列priority_queue)

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 24644   ...
  • YJX_xx
  • YJX_xx
  • 2014年06月26日 16:12
  • 608

poj 3253 Fence Repair(贪心+优先队列)

Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 36179   Accepted: 11729 Descripti...
  • chat_c
  • chat_c
  • 2016年03月13日 00:13
  • 697

poj-3253-Fence Repair-优先队列(哈夫曼树)

Description Farmer John wants to repair a small length of the fence around the pasture. He measures...

POJ 3253 Fence Repair (优先队列)

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 32431   Accepted: 10...

POJ 3253Fence Repair(哈夫曼&优先队列)

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 21545   ...
  • opm777
  • opm777
  • 2014年01月10日 15:25
  • 836

POJ 3253 Fence Repair(优先队列+思维贪心)(哈夫曼树算法)

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence an...
  • nka_kun
  • nka_kun
  • 2017年07月18日 11:08
  • 131

POJ3253 Fence Repair【哈夫曼树+优先队列】

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 48026   ...

POJ 3253 Fence Repair(优先队列构造哈夫曼树)

割木板,割木板的长度就是花的钱。比如你要8 8 5 的木板,最简单的方式是把21的木板割成13,8,花费21,再把13割成5,8,花费13,共计34,当然也可以先割成16,5的木板,花费21,再把16...

poj 3253 Fence Repair之优先队列解法

Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 50747 Accepted...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 3253 Fence Repair 优先队列
举报原因:
原因补充:

(最多只允许输入30个字)