CF988D.Points and Powers of Two
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
There are n distinct points on a coordinate line, the coordinate of i -th point equals to xi . Choose a subset of the given set of points such that the distance between each pair of points in a subset is an integral power of two. It is necessary to consider each pair of points, not only adjacent. Note that any subset containing one element satisfies the condition above. Among all these subsets, choose a subset with maximum possible size.
In other words, you have to choose the maximum possible number of points xi1,xi2,…,xim such that for each pair xij , xik it is true that ∣xij−xik∣=2d where d is some non-negative integer number (not necessarily the same for each pair of points).
输入格式
The first line contains one integer n ( 1≤n≤2⋅105 ) — the number of points.
The second line contains n pairwise distinct integers x1,x2,…,xn ( −109≤xi≤109 ) — the coordinates of points.
输出格式
In the first line print m — the maximum possible number of points in a subset that satisfies the conditions described above.
In the second line print m integers — the coordinates of points in the subset you have chosen.
If there are multiple answers, print any of them.
输入输出样例
输入#1
6 3 5 4 7 10 12
输出#1
3 7 3 5
输入#2
5 -1 2 5 8 11
输出#2
1 8
说明/提示
In the first example the answer is [7,3,5] . Note, that ∣7−3∣=4=22 , ∣7−5∣=2=21 and ∣3−5∣=2=21 . You can't find a subset having more points satisfying the required property.