POJ 1862 Stripies(解题报告)
2012-09-04 13:40
405 查看
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
Sample Output
每次把最大的两个数带入公式就好了
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
每次把最大的两个数带入公式就好了
#include<iostream> #include<math.h> #include<stdio.h> #include<algorithm> using namespace std; int main() { double a[1001]; int n,i,j; cin>>n; double temp; double max=-1,min; for(i=0;i<n;i++) { cin>>a[i]; } if(n==1) { printf("%.3lf\n",a[0]); } else { sort(a,a+n); a[n-2]=2*sqrt(a[n-1]*a[n-2]); sort(a,a+n-1); for(i=n-2;i>0;i--) { a[i-1]=2*sqrt(a[i]*a[i-1]); sort(a,a+i); } printf("%.3lf\n",a[0]); } return 0; }
相关文章推荐
- pku_1862 Stripies 解题报告
- POJ 1862 Stipies 解题报告
- poj解题报告——1862
- POJ 3356 AGTC 解题报告(Edit Distance,DP)
- poj解题报告——1082
- POJ 3076 Sudoku 解题报告(Dancing Link)
- POJ-1284-Primitive Roots 解题报告
- POJ 2367 拓扑排序 解题报告
- POJ 2739(连续素数和) 解题报告
- poj解题报告——2234
- poj 2532 stars解题报告
- POJ-1986-Distance Queries 解题报告
- poj解题报告——2348
- poj1328解题报告.
- POJ 2531 Network Saboteur解题报告(随机化算法)
- poj解题报告——poj1006
- POJ 1862 Stripies
- POJ-1308 & HDOJ-1325 Is It A Tree? 解题报告
- POJ - 2676 Sudoku解题报告(解数独)
- poj 2389 解题报告 大数乘法