poj1862 哈夫曼水题
来源:互联网 发布:手机cf国外视频软件 编辑:程序博客网 时间:2024/06/05 11:50
Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an international patent). The stripies are transparent amorphous amebiform creatures that live in flat colonies in a jelly-like nutrient medium. Most of the time the stripies are moving. When two of them collide a new stripie appears instead of them. Long observations made by our scientists enabled them to establish that the weight of the new stripie isn't equal to the sum of weights of two disappeared stripies that collided; nevertheless, they soon learned that when two stripies of weights m1 and m2 collide the weight of resulting stripie equals to 2*sqrt(m1*m2). Our chemical biologists are very anxious to know to what limits can decrease the total weight of a given colony of stripies.
You are to write a program that will help them to answer this question. You may assume that 3 or more stipies never collide together.
You are to write a program that will help them to answer this question. You may assume that 3 or more stipies never collide together.
The first line of the input contains one integer N (1 <= N <= 100) - the number of stripies in a colony. Each of next N lines contains one integer ranging from 1 to 10000 - the weight of the corresponding stripie.
The output must contain one line with the minimal possible total weight of colony with the accuracy of three decimal digits after the point.
3723050
120.000
直接构建哈夫曼,不过不是插入两个数的和而是题目中的要求插入
ac代码:
#include <stdio.h>#include <cstring>#include <iostream>#include <queue>#include <cmath>using namespace std;int main(){ int n; double m; priority_queue<double> que; while(cin>>n) { while(!que.empty()) que.pop(); for(int i=1;i<=n;i++) { scanf("%lf",&m); que.push(m); } double a,b,x; while(que.size()>1) { a=que.top(); que.pop(); b=que.top(); que.pop(); x=2*sqrt(a*b); que.push(x); } printf("%.3f\n",que.top()); } return 0;}
阅读全文
0 0
- poj1862 哈夫曼水题
- poj1862
- poj1862
- poj1862
- (POJ1862)Stripies
- 贪心--poj1862
- poj1862 贪心
- POJ1862-Stripies
- POJ1862 Stripies
- [POJ1862]Stripies
- POJ1862 水
- 1poj1862(贪心)
- poj1862(哈夫曼数)
- poj1862,优先队列
- POJ1862 Stripies 贪心
- POJ1862——Stripies
- POJ1862 Stripies 【贪心】
- [贪心]poj1862 Stripies
- 51单片机有关变量及初始化问题
- 数据分析脚本&分析特征跟label的关系&缺失特征&缺失交叉特征&相关性热图
- 一个页面从输入URL到页面加载显示完成,这个过程中都发生了什么?
- 【进程通信】之共享内存
- 约瑟夫环
- poj1862 哈夫曼水题
- BZOJ2101: [Usaco2010 Dec]Treasure Chest 藏宝箱
- Deepin Software办公
- 高斯日记
- 基础整理
- 关于HiveQL的常用语法总结(四)——其它技巧(hive代码优化)
- 连续特征的离散化的意义
- 权限模型设计+标签
- 点击EditText 使布局底部的的布局浮动到键盘的上方呢?