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.
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.
3 1 1 20 7 3 4 5 3 4 5 90 0
0.0013.64
这是一道简单的数学问题,考的就是一个数学定理,三个未知数的均值不等式。当看到题意的时候刚开始没有看懂什么,后来懂了题意。但是我就是不太明白为什么当三个边非常接近的时候就是面积最大的。也算不错吧,又弄懂一个知识点。。。
怎么证明三条边越接近面积就越大?
1:我们只需证在周长为定值和一边为1/3周长时,另外两边相等时,面积最大就可以了。 简单的方法有将三角形放到直角坐标系中,其中底边放在X轴上,底边中点放在原点上, 那么顶点轨迹就是一个椭圆,再利用椭圆证明就可以了2:这是指在三边总和固定的情况下,设周长为2p
由海伦公式:
S=√p(p-a)(p-b)(p-c),
再由均值不等式:xyz<=[(x+y+z)/3]^3
得:(p-a)(p-b)(p-c)<=[(p-a+p-b+p-c)/3]^3=(p/3)^3, 当p-a=p-b=p-c时等号成立,即a=b=c时等号成立.
因此有S<=√[p*(p/3)^3]=p^2/(3√3),
当a=b=c时,面积最大为p^2/(3√3)不过我看的是模模糊糊不太懂的样子。以后会懂,但是第一种方法很清晰明了。
固定一条边两条边总在变化这样的话就可以变成个变化的。可以包括所有的情况。
代码::::
int main() { int n; while(~scanf("%d",&n)) { if(n==0) break; int a[15]; for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+n+1); double ans=0.0; for(int i=n;i>=3;i--) { if(a[i-1]+a[i-2]>a[i]) { double p=(double)(a[i]+a[i-1]+a[i-2])/2.0; ans+=(double)sqrt(p*(p-(double)a[i])*(p-(double)a[i-1])*(p-(double)a[i-2])); i=i-2; } } printf("%.2lf\n",ans); } }