• [1167] Airline Hub

  • 时间限制: 1000 ms 内存限制: 131072 K
  • 问题描述
  • 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.
  • 输入
  • This problem has several cases. Input until EOF.
    Each case 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
    
  • 提示
  • 来源
  • Waterloo
  • 操作

显示春菜