跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0490. Problem B - Airline Hub

  • ID: 496
  • 传统题
  • 1000ms
  • 128MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Problem B - Airline Hub

题目描述

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.

样例 1

输入

3
3.2 -15.0
20.1 -175
-30.2 10

输出

3.20 -15.00

题目来源:fps-zhblue-waterloo-000129.xml;FPS 共享题包,题包内第 2 题。保留原作者与原赛事署名。