博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 1862 Stripies (简单贪心)
阅读量:5757 次
发布时间:2019-06-18

本文共 2023 字,大约阅读时间需要 6 分钟。

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 2sqrt(m1m2). 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.
Input
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.
Output
The output must contain one line with the minimal possible total weight of colony with the accuracy of three decimal digits after the point.
Sample Input
3
72
30
50
Sample Output
120.000

题意:

如果一个质量为m1和m2的stripies相撞,生成的stripies体重是2sqrt(m1m2) 。现在,科学家们想知道,如果stripies两两碰撞至只剩一个,则这一个的最小质量是多少?

题解:

优选选取序列中最大质量的两个,可以用优先队列,当然也可以不用。

#include
#include
#include
#include
using namespace std;int a[105];int main(){ int n; cin>>n; for(int i=0;i
>a[i]; sort(a,a+n); double ans=a[n-1]; for(int i=n-2;i>=0;i--) { ans=2*sqrt(ans*a[i]); } cout.setf(ios::fixed); cout.precision(3); cout<
<

转载于:https://www.cnblogs.com/orion7/p/7828079.html

你可能感兴趣的文章
HAProxy负载均衡原理及企业级实例部署haproxy集群
查看>>
开源中国动弹客户端实践(三)
查看>>
Win 8创造颠覆性体验:预览版关键更新
查看>>
vim在多文件中复制粘贴内容
查看>>
Android ContentObserver
查看>>
文章“关于架构优化和设计,架构师必须知道的事情”
查看>>
疯狂java学习笔记1002---非静态内部类
查看>>
ISA2006实战系列之一:实战ISA三种客户端部署方案(上)
查看>>
TCP服务器
查看>>
U-Mail邮件系统与泛微OA系统一体化操作指南
查看>>
AC旁挂三层交换机管理ap,二层接入ap心得
查看>>
JS中比较数字大小
查看>>
springcloud 学习-eureka搭建-为eureka添加认证
查看>>
jQuery插件的开发
查看>>
基础,基础,还是基础之JAVA基础
查看>>
如何成为一个C++高级程序员
查看>>
ant android 打包签名和渠道
查看>>
一个简单的接口,被调用并同步给出响应的方法
查看>>
Hadoop序列化与压缩
查看>>
我的友情链接
查看>>