Fighting

分寸 , 克制

POJ 1862

Stripies
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 14292 Accepted: 6707

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

题意: 给出n 个物体,分别给出每个的质量,并且两个物体(假设质量分别为m1,m2)相撞的时候变成一个物体,质量为2*sqrt(m1*m2),并且只会出现两个两个物品碰撞的情况,问最终能得到的物体的最小质量是多少。
思路:其实就是讲一个长度为n的数组降 排降序 然后对每次的数组进行 num=2.0*sqrt(num*a[i]);的操作

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <cmath>
using namespace std;
int n;
int a[105];
int b[105];
double result,num;
int cmp(int a,int b)
{
    return a>b;
}
void init()
{
    for(int i=0;i<n;i++)
        b[i]=0;
}
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
            init();
        sort(a,a+n,cmp);
        int i=0;
        num=a[0];
        for(int i=1;i<n;i++)
        {
            num=2.0*sqrt(num*a[i]);
        }
        printf("%0.3lf\n",num);
    }
    return 0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_33048603/article/details/51852138
文章标签: poj
个人分类: ACM解题报告
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

POJ 1862

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭