hdu 5135__Little Zu Chongzhi's Triangles
来源:互联网 发布:昆明医科大学网络课程 编辑:程序博客网 时间:2024/06/05 01:15
Little Zu Chongzhi's Triangles
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 900 Accepted Submission(s): 497
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.
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.
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
31 1 2073 4 5 3 4 5 900
Sample Output
0.0013.64
Source
2014ACM/ICPC亚洲区广州站-重现赛(感谢华工和北大)
纯暴力水过。
#include <cstdio>#include <cmath>#include <algorithm>using namespace std;int main(){ int n; double ch[22],p,s; while(~scanf("%d",&n)&&n) { for(int i=0;i<n;i++) { scanf("%lf",&ch[i]); } double ans=0.00; while(1) { double MAX=0.00; int a1,b1,c1; for(int a=0;a<n;a++) { for(int b=0;b<n;b++) { if(a==b) { continue; } for(int c=0;c<n;c++) { if(b==c||a==c) { continue; } if(ch[a]+ch[b]>ch[c]&&ch[a]+ch[c]>ch[b]&&ch[b]+ch[c]>ch[a]) { p=(double)(ch[c]+ch[a]+ch[b])/2.0; s=sqrt(p*(p-ch[a])*(p-ch[b])*(p-ch[c])); if(MAX<s) { MAX=s; a1=a; b1=b; c1=c; } } } } } if(MAX>0) { ch[a1]=ch[b1]=ch[c1]=0; ans+=MAX; } else { break; } } printf("%.2lf\n",ans); } return 0;}
0 0
- hdu 5135__Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles(状态压缩)
- hdu 5135 Little Zu Chongzhi's Triangles(分组dp)
- hdu 5135 Little Zu Chongzhi's Triangles(贪心)
- HDU 5135 Little Zu Chongzhi's Triangles(贪心)
- hdu 5135 Little Zu Chongzhi's Triangles 贪心
- HDU 5135I - Little Zu Chongzhi's Triangles
- HDU 5135 Little Zu Chongzhi's Triangles 状压
- HDU 5135 Little Zu Chongzhi's Triangles(数学题)
- HDU 5135 Little Zu Chongzhi's Triangles(贪心)
- HDOJ 5135 Little Zu Chongzhi's Triangles
- HDOJ 5135(Little Zu Chongzhi's Triangles)
- Little Zu Chongzhi's Triangles 5135(数学)
- mysql
- 记录我的进步- -
- Xcode常见的项目文件介绍
- Ubuntu安装单机版hadoop注意事项
- getParameter和getAttribute的区别是什么?
- hdu 5135__Little Zu Chongzhi's Triangles
- Ember
- 黑马程序员—UNIX基本指令及第一个Objective-C程序
- UVA 11464 - Even Parity
- 京东股权众筹投后总结和反思
- ZOJ-1649 Rescue
- Session对象的特点
- 计算几何--简单多边形与圆面积交
- HDU 5489 Removed Interval (LIS,变形)