1125 Chain the Ropes（25 分）

最新推荐文章于 2020-07-31 16:25:22 发布

ysq96

最新推荐文章于 2020-07-31 16:25:22 发布

阅读量323

点赞数

本文链接：https://blog.csdn.net/ysq96/article/details/81543943

版权

PAT 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

本文介绍了一种算法，用于解决如何将多段不同长度的绳子通过折叠和串连的方式组合成尽可能长的单一绳子的问题。该算法首先将所有绳子长度进行排序，然后依次选取最短的两段绳子进行串连，每次串连后绳子的长度减半，直至所有绳子都被串连起来。

摘要由CSDN通过智能技术生成

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.

Sample Input:

8
10 15 12 3 4 13 1 15

Sample Output:

思路：

给定一段一段的绳子，你需要把它们串成一条绳。每次串连的时候，是把两段绳子对折，再如下图所示套接在一起。这样得到的绳子又被当成是另一段绳子，可以再次对折去跟另一段绳子串连。每次串连后，原来两段绳子的长度就会减半。给定N段绳子的长度，你需要找出它们能串成的绳子的最大长度

C++：

#include "iostream"
#include "algorithm"
#include "vector"
using namespace std;
vector<int> accord;
int main(){
	int n;
	scanf("%d",&n);
	accord.resize(n);
	for (int i=0;i<n;i++)
		scanf("%d",&accord[i]);
	sort(accord.begin(),accord.end());
	int maxl=accord[0];
	for (int i=1;i<n;i++)
	{
		maxl=(maxl+accord[i])/2;
	}
	printf("%d\n",maxl);
	return 0;
}