E. Maximum Subsequence Value

最新推荐文章于 2021-03-31 17:14:39 发布

小白18651

最新推荐文章于 2021-03-31 17:14:39 发布

阅读量305

点赞数

本文链接：https://blog.csdn.net/m0_47576396/article/details/106623861

版权

该问题要求找到一个正整数数组的最大子序列值，该值由子序列中元素的二进制表示中设置的位的权重之和计算得出。输入包含数组的大小和元素，输出是可获得的最大值。示例解释了如何计算这个值。

摘要由CSDN通过智能技术生成

E. Maximum Subsequence Value time limit per test2 seconds memory limit
per test256 megabytes inputstandard input outputstandard output
Ridhiman challenged Ashish to find the maximum valued subsequence of
an array a of size n consisting of positive integers.

The value of a non-empty subsequence of k elements of a is defined as
∑2i over all integers i≥0 such that at least max(1,k−2) elements of
the subsequence have the i-th bit set in their binary representation
(value x has the i-th bit set in its binary representation if
⌊x2i⌋mod2 is equal to 1).

Recall that b is a subsequence of a, if b can be obtained by deleting
some(possibly zero) elements from a.

Help Ashish find the maximum value he can get by choosing some
subsequence of a.

Input The first line of the input consists of a single integer n
(1≤n≤500) — the size of a.

The next line consists of n space-separated integers — the elements of
the array (1≤ai≤1018).

Output Print a single integer — the maximum value Ashish can get by
choosing some subsequence of a.

Examples inputCopy 3 2 1 3 outputCopy 3 inputCopy 3 3 1 4 outputCopy 7
inputCopy 1 1 outputCopy 1 inputCopy 4 7 7 1 1 outputCopy 7 Note For
the first test case, Ashish can pick the subsequence {2,3} of size 2.
The binary representation of 2 is 10 and that of 3 is 11. Since
max(k−2,1) is equal to 1, the value of the subsequence is 20+21 (both
2 and 3 have 1-st bit set in their bi