Little Zu Chongzhi's Triangles

Little Zu Chongzhi's Triangles

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 743    Accepted Submission(s): 399

Problem Description

Zu Chongzhi (429–500) was a prominent Chinese mathematician and astronomer during the Liu Song and Southern Qi Dynasties. Zu calculated the value ofπ to the precision of six decimal places and for a thousand years thereafter no subsequent mathematician computed a value this precise. Zu calculated one year as 365.24281481 days, which is very close to 365.24219878 days as we know today. He also worked on deducing the formula for the volume of a sphere.

It is said in some legend story books that when Zu was a little boy, he liked mathematical games. One day, his father gave him some wood sticks as toys. Zu Chongzhi found a interesting problem using them. He wanted to make some triangles by those sticks, and he wanted the total area of all triangles he made to be as large as possible. The rules were :

1) A triangle could only consist of 3 sticks.
2) A triangle's vertexes must be end points of sticks. A triangle's vertex couldn't be in the middle of a stick.
3) Zu didn't have to use all sticks.

Unfortunately, Zu didn't solve that problem because it was an algorithm problem rather than a mathematical problem. You can't solve that problem without a computer if there are too many sticks. So please bring your computer and go back to Zu's time to help him so that maybe you can change the history.

 

 

Input

There are no more than 10 test cases. For each case:

The first line is an integer N(3 <= N<= 12), indicating the number of sticks Zu Chongzhi had got. The second line contains N integers, meaning the length of N sticks. The length of a stick is no more than 100. The input ends with N = 0.

 

 

Output

For each test case, output the maximum total area of triangles Zu could make. Round the result to 2 digits after decimal point. If Zu couldn't make any triangle, print 0.00 .

 

 

Sample Input

3 1 1 20 7 3 4 5 3 4 5 90 0

 

 

Sample Output

0.00 13.64

 题解：写了一下午，醉了，刚开始考虑的太复杂。。。竟然直接想到神搜。。。其实这个题直接从大到小排序，因为每次的三个边都是最大的，所以面积肯定也是最大，从大到小排序又保证了两条小边相加的问题。。。如此简单的一道题考虑的如此复杂，也是醉了，死胡同中漫步。。。。

代码：

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<math.h>
using namespace std;
int cmp(int a,int b){
    return a>b;
}
double area(int a,int b,int c){
    //printf("%d %d %d
",a,b,c);
    double q=(a+b+c)/2.0;
    double p;
    p=sqrt(1.0*q*(q-a)*(q-b)*(q-c));
    return p;
}
int stick[15];
int main(){
    int N;
    while(~scanf("%d",&N),N){
     for(int i=0;i<N;i++){
        scanf("%d",&stick[i]);
     }
     sort(stick,stick+N,cmp);
     double ans=0;
        for(int i=0;i+2<N;i++){
            if(stick[i+2]+stick[i+1]>stick[i]){
                ans+=area(stick[i],stick[i+1],stick[i+2]);
               i+=2;
            }
        }
        printf("%.2lf
",ans);
    }
    return 0;
}