Nise-Anti-AK Problem(2018 ACM-ICPC 中国大学生程序设计竞赛线上赛 L题)

题目链接
Description:

Peppa has been learning math recently, he is trapped by a easy problem. He is given a sequence of n numbers, what he need to do is finding the number ai which have the largest number f(ai). The function f(x)=∑(i|x) where i goes form 0 to x, | is the symbol of or-by-bit calculate.

Input:

The first line of the input has an integer T(1<=T<=10), which represents the number of test cases.

In each test case, the first line of the input contains an integers n(1<=n<=1000)–the number of the integers, next line has n integers a[i] (1 <= a[i] <= 10000).

Output:

Each test case output an integer ai which have the largest number f(ai).

忽略每行输出的末尾多余空格
样例输入

1
3
2 3 5
样例输出

5
题目来源

2018 ACM-ICPC 中国大学生程序设计竞赛线上赛

解题思路:
直接按照公式套就可以了

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,a,b,mx,sum,flag;
    scanf("%d",&n);
    while(n--){
        mx = INT_MIN;
        scanf("%d",&a);
        for(int i = 0;i < a;i++){
            scanf("%d",&b);
            sum = 0;//每次都必须清零
            for(int j = 0;j <= b;j++)
                sum += (j | b);
            if(sum > mx){
                mx = sum;
                flag = b;
            }
        }
        printf("%d\n",flag);
    }
    return 0;
}