老BOJ 07 Fence Repair

Fence Repair

Accept:199	Submit:784
Time Limit:1000MS	Memory Limit:65536KB

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 ≤ 1,000)) planks of wood, each having some integer length L_i (1 ≤ L_i ≤ 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 L_i). 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).

哈夫曼树-给定n个权值作为n个叶子结点，构造一棵二叉树，若带权路径长度达到最小

#include<cstdio>
#include<queue>
#include<cstdlib>
#include<functional>
#define ll long long
using namespace std;
priority_queue<ll,vector<ll>,greater<ll> >data;
int main(){int i,j,n,tmp;scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&tmp),data.push(tmp);ll sum=0;while(data.size()>1){ll min1=data.top();data.pop();ll min2=data.top();data.pop();sum+=min1+min2;data.push(min1+min2);}printf("%lld\n",sum);return 0;
}

老BOJ 07 Fence Repair相关推荐

[BZOJ1724][Usaco2006 Nov]Fence Repair 切割木板
1724: [Usaco2006 Nov]Fence Repair 切割木板 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 1272 Solved: ...
1724: [Usaco2006 Nov]Fence Repair 切割木板( 贪心 )
倒过来看 , 每次总是选择最短的两块木板合并 , 用heap维护 ------------------------------------------------------------------- ...
POJ 3253 Fence Repair C++ STL multiset 可解
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 53106 Accepted: 17508 Descri ...
POJ 3253 -- Fence Repair
Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 55661 Accepted: 18331 De ...
编程算法 - 篱笆修理(Fence Repair) 代码(C)
篱笆修理(Fence Repair) 代码(C) 本文地址: http://blog.csdn.net/caroline_wendy 题目: 把一块木板切成N块, 每次切两块, 分割的开销是木板长度, ...
Fence Repair （二叉树求解）（优先队列，先取出小的）
题目链接:http://poj.org/problem?id=3253 Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Sub ...
Fence Repair(不会优先队列的看过来)
Fence Repair(不会优先队列的看过来) Farmer John wants to repair a small length of the fence around the pasture. ...
BZOJ 1724: [Usaco2006 Nov]Fence Repair 切割木板
题目 1724: [Usaco2006 Nov]Fence Repair 切割木板 Time Limit: 5 Sec Memory Limit: 64 MB Description Farmer ...
bzoj1724[Usaco2006 Nov]Fence Repair 切割木板*
bzoj1724[Usaco2006 Nov]Fence Repair 切割木板题意: FJ需要n块木板,第i块木板长度为ai.但他只有一块长度为sigma(i,1,n)ai的木板.每切一次的代价为 ...

老BOJ 07 Fence Repair

老BOJ 07 Fence Repair相关推荐

最新文章

热门文章