1、題目0035 Fence(籬笆)題目來源：Ural推薦者：金愷英文原文FenceTime Limit: 1 secondMemory Limit: 1000KProblemWorkers are going to enclose a new working region with a fence. For their convenience the enclosed area has to be as large as possible. They have N rectangular blocks to build the fence. The length of the i-th bloc

2、k is Li meters. All blocks have the same height of 1 meter. The workers are not allowed to break blocks into parts. All blocks must be used to build the fence. InputThe first line of the input file contains one integer N (3 = N = 100).The following N lines describe fence blocks. Each block is repres

3、ented by its length in meters (integer number, 1 = Li = 100). OutputWrite to the output file one non-negative number S - maximal possible area of the working region (in square meters). S must be written with two digits after the decimal point. If it is not possible to construct the fence from the sp

4、ecified blocks, write 0.00. Sample OutputSample Output28.00Sample Input410554中文試題籬笆Time Limit: 1 secondMemory Limit: 1000K問題：工人們將要用柵欄圍成一個新的工作區(qū)域。為了方便生產(chǎn)，圍成的區(qū)域要盡量大. 他們用N個木料來建造柵欄。第i個木料的長度是Li米。所有的木料有相同的高度1米。工人們不能夠切割木料。所有的N個木料必須使用。 輸入：第一行包括一個整數(shù)N (3 = N = 100).接下來N行描述木料.。每一個木料用他的長度（單位米，1 = Li r0 Fr 2。因為題目只要求精確到小數(shù)點后4位，所以二分求解半徑即可。圓心在形外。類似于Fr，定義函數(shù)，于是滿足r 0。同理，二分求解。 算法在思維、空間、時間上均不復(fù)雜，可謂優(yōu)秀。劉汝佳： 我用過二分法以外