Stripies
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 5363 | Accepted: 2746 |
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.
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
解题思路的关键在于:
最小的值是从大向小进行计算,可以使用不等式进行证明。
import java.util.*; import java.text.*; public class Main { public static void main(String[] args) { Scanner cin = new Scanner(System.in); int num = Integer.valueOf(cin.nextLine()).intValue(); List list = new ArrayList(); for(int i = 0; i < num; i++) list.add(Double.valueOf(cin.nextLine())); Collections.sort(list); double result, temp = 0; double a, b = 0; if(list.size() == 1) result = Double.valueOf((Double)list.get(0)).doubleValue(); else { int index = list.size() - 1; a = Double.valueOf((Double)list.get(index)).doubleValue(); b = Double.valueOf((Double)list.get(index-1)).doubleValue(); result = 2 * Math.sqrt(a * b); for(int i = index - 2; i>=0; i--) { a = Double.valueOf((Double)list.get(i)).doubleValue(); result = 2 * Math.sqrt(a * result); } } DecimalFormat df = new DecimalFormat("#.000"); System.out.println(df.format(result)); } }
发表评论
-
POJ ACM习题【No.2328】
2009-07-05 19:43 895Guessing Game Time ... -
POJ ACM习题【No.3157】
2009-04-26 23:54 1633Java vs C++ Time Lim ... -
POJ ACM习题【No.2924】
2009-04-26 11:52 919Gauß in Elementary School ... -
POJ ACM习题【No.3176】
2009-04-26 10:53 1043Cow Bowling Time Lim ... -
POJ ACM习题【No.3173】
2009-04-25 23:30 900Parkside's Triangle ... -
POJ ACM习题【No.2845】
2009-04-25 22:25 120801000001 Time Limit: ... -
POJ ACM习题【No.2140】
2009-04-25 21:26 932Herd Sums Time Limit ... -
POJ ACM习题【No.1969】
2009-04-25 20:59 858Count on Canton Time ... -
POJ ACM习题【No.2840】
2009-04-25 19:24 1002Big Clock Time Limit ... -
POJ ACM习题【No.2521】
2009-04-24 22:41 846How much did the businessman l ... -
POJ ACM习题【No.1326】
2009-04-24 22:14 1008Mileage Bank Time Li ... -
POJ ACM习题【No.3325】
2009-04-24 21:15 1088ICPC Score Totalizer Software ... -
POJ ACM习题【No.2756】
2009-04-24 20:28 770Autumn is a Genius T ... -
POJ ACM习题【No.3062】
2009-04-24 20:10 805Celebrity jeopardy ... -
POJ ACM习题【No.1547】
2009-04-23 20:03 770Clay Bully Time Limi ... -
POJ ACM习题【No.1552】
2009-04-23 19:39 747Doubles Time Limit: ... -
POJ ACM习题【No.1007】
2009-04-23 19:24 846DNA Sorting Time Lim ... -
POJ ACM习题【No.1565】
2009-04-22 22:40 839Skew Binary Time Lim ... -
POJ ACM习题【No.2403】
2009-04-22 22:18 857Hay Points Time Limi ... -
POJ ACM习题【No.3224】
2009-04-22 19:57 740Lab杯 Time Limit: 1 ...
相关推荐
方便大家有针对性地联系 祝大家AC愉快~
pojACM题目分类,便于各类型同学分别做题有所参考
相信大家在做poj上的题目的时候如果没有分类的话很迷茫吧....这里有一份目前比较全面的poj题目分类..
02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ题库使用指南.docx02.北大POJ...
acm数据结构总结.doc acm数据结构总结.doc
poj acm题解,包括绝大部分poj题目的题解,可以供acm爱好者学习研究
本文件是ACM里的一些题目的源码、原题和习题的分析及详细解答。欢迎各位下载
http://acm.pku.edu.cn/JudgeOnline/ acm的AC解题报告
POJ ACM 1015 Jury Compromise 两种解法 解题报告
西工大C语言POJ习题答案.docx
PKU 、POJ ACM/ICPC300多题的代码,还有各种典型问题的分类代码
poj 2007 Scrambled Polygon.md
poj 3183 Stump Removal.md
poj 2430 Lazy Cows.md
poj 2900 Griddy Hobby.md
poj 3435 Sudoku Checker.md
poj 1984 Navigation Nightmare.md
poj 2174 Decoding Task.md
poj 2386 Lake Counting.md
poj 3585 Accumulation Degree.md