Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 39116 | Accepted: 12719 |
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).
思路:切割后的木板长度就相当于树的叶子节点,叶子节点的深度对应了为了得到这个木板的切割次数,开销就是 sum(木板长度*叶子节点深度)。即构建哈夫曼树,把所有叶子节点看成树,每次取最小和次小节点,合成一棵树,然后去掉这两颗树,加入合成后的树根节点,以此类推。
代码如下:
<strong><span style="font-size:18px;">#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int a[20005];
int main()
{
int n,i,j;
long long sum = 0;
cin>>n;
for(i = 0; i < n; i++)
{
cin>>a[i];
}
while(n > 1)
{
sort(a,a+n);//排序
int min1 = 0, min2 = 1;//取最小树根和次小树根
int temp = a[min1] + a[min2];
sum += temp;//两树合并
a[min1] = temp;
a[min2] = a[n - 1];
n--;
}
cout<<sum<<endl;
return 0;
} </span></strong>