• [F] Farmland

  • 时间限制: 2000 ms 内存限制: 65535 K
  • 问题描述
  • Elaine is a farmer. Today she got a farmland from her grand-grand-grand-...-grand-father.
    In fact, that's a forest with a number of trees. She decide to cut down many trees and leave some. Then she will encircle her farmland with the left trees.
    To make her farmland as bigger as possible, which trees should she leave?
  • 输入
  • This problem has several cases. The first line of each case is an integer N (2 < N <= 100000).
    Then follow N lines. The ith line is the coordinate of ith tree. (Count i from 0).
    You should consider that there's no possible that all trees are in a line.
  • 输出
  • For each case, you should output the number of each left tree. From small to big.
  • 样例输入
  • 5
    1.0 2.0
    1.0 2.6
    2.3 3.8
    2.4 7.9
    0.0 -9.0
    
  • 样例输出
  • 1 2 3 4
    
  • 提示
  • 来源
  • XadillaX
  • 操作

显示春菜