Need for Speed

最新推荐文章于 2022-04-13 08:15:34 发布

pipixia233333

最新推荐文章于 2022-04-13 08:15:34 发布

阅读量611

点赞数

分类专栏： C

本文链接：https://blog.csdn.net/qq_41071646/article/details/79927740

版权

C 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

这个是国外原本的oj（在国内可能会很卡顿）点击打开链接

这个是vj的网址有时候可能会提交失败点击打开链接

题意：

Sheila is a student and she drives a typical student car: it is old, slow, rusty, and falling apart. Recently, the needle on the speedometer fell off. She glued it back on, but she might have placed it at the wrong angle. Thus, when the speedometer reads s, her true speed is s+c, where c is an unknown constant (possibly negative).

Sheila made a careful record of a recent journey and wants to use this to compute c. The journey consisted of n segments. In the ith segment she traveled a distance of di and the speedometer read si for the entire segment. This whole journey took time t. Help Sheila by computing c.

Note that while Sheila’s speedometer might have negative readings, her true speed was greater than zero for each segment of the journey.

Input

The first line of input contains two integers n (1≤n≤1000), the number of sections in Sheila’s journey, and t (1≤t≤106), the total time. This is followed by n lines, each describing one segment of Sheila’s journey. The ith of these lines contains two integers di (1≤di≤1000) and si (|si|≤1000), the distance and speedometer reading for the ith segment of the journey. Time is specified in hours, distance in miles, and speed in miles per hour.

Output

Display the constant c in miles per hour. Your answer should have an absolute or relative error of less than 10−6.

Sample Input 1	Sample Output 1
3 5 4 -1 4 0 10 3	3.000000000

Sample Input 2	Sample Output 2
4 10 5 3 2 2 3 6 3 1	-0.508653377

这个题一开始读的蒙蒙的最后才知道用二分不断的来缩小范围然后直到达到题目上所要求的精度然后这道题因为速度为正数所以将不是正数的情况给去掉。。。。。代码如下

#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<iostream>
#include<set>
#include<map>
#include<string.h>
using namespace std;
int k[1050],ll[1050];
int main()
{
      int n,t;
      double l,r,sum,mid;
      scanf("%d%d",&n,&t);
      for(int i=0;i<n;i++)
      scanf("%d%d",&k[i],&ll[i]);
      l=-0x7f7f7f7f,r=0x7f7f7f7f;
      while(r-l>0.0000001)
      {
             mid=(r+l)/2;
             sum=0;
             for(int i=0;i<n;i++)
             {
                  if(mid+ll[i]<0)
                  {
                       sum=t+1;
                       break;
                  }
                  sum+=k[i]/(ll[i]+mid);
             }
             //printf("%lf\n",mid);
             if(sum<t)
                  r=mid;
             else
                l=mid;
      }
      printf("%lf\n",l);
    return 0;
}