PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
来源:互联网 发布:淘宝 左轮吉他怎么样 编辑:程序博客网 时间:2024/06/05 14:26
1125. Chain the Ropes (25)
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:810 15 12 3 4 13 1 15Sample Output:
14
题意:有n根绳子,每次可以选择两个合并,合并后长度为两条加起来的一半,问最终最长为多少
解题思路:因为合并后肯定变短,先将绳子从小到大排序,然后按顺序合并
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int a[10060],n;int main(){while (~scanf("%d", &n)){for (int i = 1; i <= n; i++) scanf("%d", &a[i]);sort(a + 1, a + 1 + n);for (int i = 2; i <= n; i++) a[i] = (a[i] + a[i - 1]) / 2;printf("%d\n", a[n]);}return 0;}
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- PAT (Advanced Level) 1125. Chain the Ropes (25)
- PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
- 【PAT】【Advanced Level】1125. Chain the Ropes (25)
- PAT 1125. Chain the Ropes (25)-甲级
- PAT 1125. Chain the Ropes (25)
- PAT A1125. Chain the Ropes (25)(哈夫曼树)
- PAT甲级.1125. Chain the Ropes (25)
- PAT甲级 1125. Chain the Ropes (25)
- PAT 甲级 1125. Chain the Ropes (25)
- 浙大PAT (Advanced Level) Practise 1012 The Best Rank (25)
- PAT (Advanced Level) Practise 1012. The Best Rank (25)
- PAT (Advanced Level) Practise 1012 The Best Rank (25)
- PAT (Advanced Level) Practise 1055 The World's Richest (25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- PAT (Advanced Level) Practise 1094 The Largest Generation (25)
- PAT (Advanced Level) Practise 1055 The World's Richest (25)
- 第7篇:ui-router登录检查实现权限控制
- 求出方程ax^2+bx+c=0的实根
- 1513 求Sn=1!+2!+3!+4!+5!+…+n!之值,其中n是一个数字。
- java.sql.SQLException: Can not issue data manipulation statements with executeQuery()
- 序列化的概念和序列化ID的作用?
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- 技术文章--一名3年工作经验的程序员应该具备的技能
- 如何做一个 Letterpress 拼词器
- JPA relations
- 猿题库 iOS 客户端架构设计
- 2017Google Codejam round2 Problem A. Fresh Chocolate
- 【实训】关于Android ButterKnife注解框架的使用
- mysql数据库
- 计算分数的精确值