#E. 凸多边形 凸包

    Type: Default 1000ms 256MiB

凸多边形 凸包

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

给定 nn 个顶点,选一些点作为顶点,构成凸多边形。 问最多选多少个点。

输入 n ,接下来 n 个点的坐标。

输出 最大的定点数。

n128n \le 128 坐标范围 绝对值 1000\le 1000

source

6 
0 2 
3 2 
5 3 
2 0 
4 1 
2 4
5

数据范围

10% n10n \le 10

20% n32n \le 32

50% n64n \le 64

ARC104

Not Attended
Status
Done
Rule
IOI
Problem
5
Start at
2023-6-30 8:15
End at
2023-6-30 10:15
Duration
2 hour(s)
Host
Partic.
14