POJ 1862 Stripies

本文介绍了一种名为Stripies的生命形式,并提出一个有趣的数学问题:如何通过不断合并两个Stripies来最小化群体总重量,每次合并后的新成员重量为两成员重量乘积的两倍平方根。
Stripies
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 16446 Accepted: 7479

Description

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. 

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

Source

Northeastern Europe 2001, Northern Subregion

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top

题意:给出N个数,选取两个数a,b合并得c=2*sqrt(a*b),最后留下一个最小的数

思路:每次选取最大的两个数合并

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<queue>
using namespace std;
double a[1100];
int main()
{
	int n,i,j;
	while (scanf("%d", &n) != EOF)
	{
		priority_queue<double>q;
		for (i = 0; i < n; i++)
		{
			scanf("%lf", &a[i]);
			q.push(a[i]);
		}
		while (q.size() != 1)
		{
			double b = q.top();
			q.pop();
			double c = q.top();
			q.pop();
			q.push(2 * sqrt( b * c));
		}
		printf("%.3lf\n", q.top());
	}
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值