#include<bits/stdc++.h>
using namespace std;
int a[10];
double x,y,z;
int main()
{
int n;
cin >> n;
for (int i = 1;i <= n;i ++) cin >> a[i];
double ma = 0;
bool flag = false;
for (int i = 1;i <= n-2;i ++)
{
x = 0;
for (int j = 1;j <= i;j ++) x += a[j];
for (int k = i + 1;k <= n-1;k ++)
{
y = 0;
for (int q = i + 1;q <= k;q ++) y += a[q];
z = 0;
for (int e = k + 1;e <= n;e ++) z += a[e];
if (x+y<=z||x+z<=y||y+z<=x)
{
continue;
}
else
{
double p = (x+y+z)/2;
double S = sqrt(p*(p-x)*(p-y)*(p-z));
if (S >= ma) ma = S;
flag = true;
}
}
}
if (flag) printf("%.1lf",ma);
else cout << -1;
return 0;
}
原文链接: https://www.cnblogs.com/mapgm/p/15799444.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/185285
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!