博客
关于我
Little Zu Chongzhi's Triangles
阅读量:612 次
发布时间:2019-03-13

本文共 2816 字,大约阅读时间需要 9 分钟。

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
 题解:写了一下午,醉了,刚开始考虑的太复杂。。。竟然直接想到神搜。。。其实这个题直接从大到小排序,因为每次的三个边都是最大的,所以面积肯定也是最大,从大到小排序又保证了两条小边相加的问题。。。如此简单的一道题考虑的如此复杂,也是醉了,死胡同中漫步。。。。
代码:
1 #include
2 #include
3 #include
4 #include
5 using namespace std; 6 int cmp(int a,int b){ 7 return a>b; 8 } 9 double area(int a,int b,int c){10 //printf("%d %d %d\n",a,b,c);11 double q=(a+b+c)/2.0;12 double p;13 p=sqrt(1.0*q*(q-a)*(q-b)*(q-c));14 return p;15 }16 int stick[15];17 int main(){18 int N;19 while(~scanf("%d",&N),N){20 for(int i=0;i
stick[i]){27 ans+=area(stick[i],stick[i+1],stick[i+2]);28 i+=2;29 }30 }31 printf("%.2lf\n",ans);32 }33 return 0;34 }

 

转载地址:http://zghaz.baihongyu.com/

你可能感兴趣的文章
Thymeleaf sec:authorize 标签不生效
查看>>
Iterable与Iterator
查看>>
微信JS-SDK DEMO页面和示例代码
查看>>
一张图搞定RPC框架核心原理
查看>>
Scala中的包
查看>>
他来了他来了,他带着云栖大会的免费门票走来了
查看>>
获取linux 主机cpu类型
查看>>
pwntools编写技巧
查看>>
How2Heap笔记(三)
查看>>
测试tensorflow是否安装成功 出现 SyntaxError: invalid syntax的错误
查看>>
算法训练 未名湖边的烦恼(递归,递推)
查看>>
什么是接口
查看>>
记录-基于springboot+vue.js实现的超大文件分片极速上传及流式下载
查看>>
JavaScript高级程序设计第四版学习记录-第九章代理与反射
查看>>
Allegro中如何消除器件本身Pin间距报错
查看>>
Flask--简介
查看>>
16 python基础-恺撒密码
查看>>
Frame--Api框架
查看>>
Boostrap技能点整理之【网格系统】
查看>>
新闻发布项目——业务逻辑层(UserService)
查看>>