Pku3968 Jungle Outpost
时间限制：10s 空间限制：128MB
题目描述
我方现在有N个据点，司令部建立这些点围成的区域中。现在敌人准备爆掉其中一些点。使得无论我方将司令部建在哪里，最终都不会在剩下的点围成的区域中。
输入格式
The first line of the input file contains a single integer n (3 <= n <= 50 000) — the number of watchtowers. The next n lines of the input file contain the Cartesian coordinates of watchtowers, one pair of coordinates per line. Coordinates are integer and do not exceed 106 by absolute value. Towers are listed in the order of traversal of their convex hull in clockwise direction.
输出格式
Write to the output file the number of watchtowers the enemy has to blow up to compromise headquarters protection if the headquarters are placed optimally.
样例输入
5 0 0 0 10 10 20 20 10 25 0
样例输出
2
提示
没有写明提示
题目来源
没有写明来源