Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the figure. The resulting chain will be treated as another segment of rope and can be folded again. After each chaining, the lengths of the original two segments will be halved.
Your job is to make the longest possible rope out of N given segments.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (2≤N≤104). Then N positive integer lengths of the segments are given in the next line, separated by spaces. All the integers are no more than 104.
Output Specification:
For each case, print in a line the length of the longest possible rope that can be made by the given segments. The result must be rounded to the nearest integer that is no greater than the maximum length.
这题类似哈夫曼树,每次挑最短的两个合并。
为什么呢:
如:
8
10 15 12 3 4 13 1 15
设 段长依次为 x1,x2,x3,x4,x5,x6,x7,x8
如果从头合并最终长度len=(((((((x1+x2)*(1/2)+x3)*(1/2)+x4)*(1/2)+x5)*(1/2)+x6)*(1/2)+x7)*(1/2)+x8)*(1/2)
即:len=x1*(1/2)^7+x2*(1/2)^7+x3*(1/2)^6+x4*(1/2)^5+x5*(1/2)^4+x6*(1/2)^3+x7*(1/2)^2+x8*(1/2);
所以如果x1,x2,x3,x4,x5,x6,x7,x8 的大小是从小到大排的话 最后合成的长度zui'最长,因为损耗最小
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,in;
double seg[10001];
int main(){
cin>>n;
for(int i=0;i<n;++i){
cin>>seg[i];
}
int i;
sort(seg,seg+n);
for(i=0;i<n-1;++i){
seg[i+1]=(seg[i]+seg[i+1])/2;
}
cout<<(int)seg[i];
}