哗啦啦村的刁难(4)

 1 #include <iostream>
 2 #include <bits/stdc++.h>
 3 #include <algorithm>
 4 
 5 using namespace std;
 6 int n[105];
 7 
 8 int main() {
 9     int a;
10     while (cin >> a) {
11         double Max=-1;
12         memset(n,0,sizeof(n));
13         for (int i = 0; i < a; i++) {
14             cin >> n[i];
15         }
16         sort(n, n + a);
17             for (int i = 0; i < a; i++) {
18                 for (int j = i + 1; j < a; j++) {
19                     for (int k = j + 1; k < a; k++) {
20                         if(n[i]+n[j]>n[k]) {
21                             double y = (n[i] + n[j] + n[k])/2.0;
22                             double x = sqrt(y * (y - n[i]) * (y - n[j]) * (y - n[k]));
23                             if(x>Max) Max=x;
24                         }else
25                             break;
26                     }
27                 }
28             }
29         printf("%.0f\n", Max);  
30     }
31     return 0;
32 }