好贷网好贷款

poj 1862 贪心

发布时间:2016-12-4 16:16:14 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"poj 1862 贪心",主要涉及到poj 1862 贪心方面的内容,对于poj 1862 贪心感兴趣的同学可以参考一下。

Stripies Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 11128   Accepted: 5327 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 Source Code Problem: 1862 Memory: 184K Time: 16MS Language: C++ Result: Accepted Source Code #include<iostream> #include<math.h> #include<algorithm> using namespace std; #define MAX 101 double weight[MAX]; int n; bool cmp(int a, int b) { return a > b; } int main() { scanf("%d", &n); int i; for(i = 0; i < n; i ++) scanf("%lf", &weight[i]); for(i = 0; i < n - 1; i ++) { sort(weight + i, weight + n, cmp); weight[i + 1] = 2 * sqrt(double(weight[i] * weight[i + 1])); } printf("%.3lf\n", weight[n - 1]); }

上一篇:有用的十大算法
下一篇:hanoi问题详解

相关文章

关键词: poj 1862 贪心

相关评论