若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1101: Problem B – Airline Hub

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,514

题目描述

Problem B – Airline Hub
World Wide Flyer has landing rights at several airports throughout the world. They wish to place their central hub at the airport that minimizes the maximum direct flying distance from the hub to any other airport in the world.
Input consists of a line containing n <= 1000, the number of airports. n lines follow, each giving the latitude (between -90 and +90 degrees) and longitude (between -180 and +180 degrees) of an airport.
To two decimal places, give the latitude and longitude of the airport that best serves as a hub. If there are several any one will do.

输入

暂无

输出

暂无

样例输入

3
3.2 -15.0
20.1 -175
-30.2 10

样例输出

3.20 -15.00

参考代码

#include <stdio.h>
#include <math.h>
int n;
double x[1000], y[1000], r[1000];
int top[1000];
int possible = 1;
double ne = 1000, nw = 1000;
main() 
{
    int i,j,k;
    scanf("%d",&n);
    for (i=0;i<n;i++) scanf("%lf%lf%lf",&x[i],&y[i],&r[i]);
    for (i=0;i<n;i++) if (y[i]+r[i] > 1000) visit(i);
    if (possible) printf(
         "Bill enters at (0.00, %0.2lf) and leaves at (1000.00, %0.2lf).n",nw,ne);
   else printf("Bill will be bitten.n");
}
visit(int i){
   int j,k;
   double yy;
   if (top[i]++) return;
   for (j=0;j<n;j++) {
      if (hypot(x[j]-x[i],y[j]-y[i]) < r[i]+r[j]) visit(j);
   }
   if (y[i]-r[i] < 0) possible = 0;
   if (x[i]-r[i] < 0) {
      yy = y[i] - sqrt(r[i]*r[i] - x[i]*x[i]);
      if (yy < nw) nw = yy;
   }
   if (x[i]+r[i] > 1000) {
      yy = y[i] - sqrt(r[i]*r[i] - (1000-x[i])*(1000-x[i]));
      if (yy < ne) ne = yy;
   }
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

Skip 原站点 Dreams孤独患者
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist