国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學(xué)院 > 開發(fā)設(shè)計 > 正文

HDU 1969 高精度

2019-11-11 03:25:59
字體:
供稿:網(wǎng)友
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.InputOne line with a positive integer: the number of test cases. Then for each test case:One line with two integers N and F with 1 ≤ N, F ≤ 10 000: the number of pies and the number of friends.One line with N integers ri with 1 ≤ ri ≤ 10 000: the radii of the pies.OutputFor each test case, output one line with the largest possible volume V such that me and my friends can all get a pie piece of size V. The answer should be given as a floating point number with an absolute error of at most 10?3.Sample Input
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2Sample Output
25.13273.141650.2655
思路:二分法,但此題對精度要求很高
#include<stdio.h>#include<cstdlib>#include<math.h>#define pi acos(-1.0)//3.1415926過不了,此題對精度要求很高#define exp 1e-7//時間復(fù)雜度的大小也與精度的大小有關(guān)int N,F;using namespace std;int str[10005];int judge(double mid){   long long  sum=0;    for(int i=1;i<=N;i++)            sum+=(int)(1.0*str[i]*str[i]*pi/mid);     return sum>=(F+1)? 1:0;//關(guān)鍵是在等于時候的判斷}int main(){    //freopen("e://in.txt","r",stdin);    int V;    scanf("%d",&V);    while(V--)    {        double   sum=0.0;        scanf("%d%d",&N,&F);        for(int i=1;i<=N;i++)          {              scanf("%d",&str[i]);              sum+=1.0*str[i]*str[i]*pi;          }  sum/=1.0*(F+1);          double left=0.0,right=sum,mid;          while(right-left>=exp)          {             mid=(left+right)/2.0;            if(judge(mid))                left=mid;             else                right=mid;          }          PRintf("%.4lf/n",left);    }}總結(jié):1.pi =acos(-1.0),3.1415926不夠精確
     2.精度也影響著時間復(fù)雜度
發(fā)表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發(fā)表
主站蜘蛛池模板: 红原县| 天台县| 南木林县| 盖州市| 衡南县| 石泉县| 马鞍山市| 彭州市| 出国| 五莲县| 平顶山市| 白河县| 偃师市| 山西省| 遵化市| 兰溪市| 清丰县| 琼中| 凌海市| 蚌埠市| 盘锦市| 顺义区| 兰考县| 连城县| 胶州市| 交城县| 玉山县| 扬州市| 孝感市| 佛冈县| 囊谦县| 桓仁| 郴州市| 阳江市| 襄樊市| 黑山县| 巴林左旗| 开鲁县| 镇远县| 怀来县| 湄潭县|