Chip Factory(HDU 5536 纯暴力)

Chip Factory(传送门)

Time Limit : 18000/9000ms (Java/Other) Memory Limit : 262144/262144K (Java/Other)
Total Submission(s) : 23 Accepted Submission(s) : 14

Problem Description

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces $n$ chips today, the $i$-th chip produced this day has a serial number $s_i$.

At the end of the day, he packages all the chips produced this day, and send it to wholesalers. More specially, he writes a checksum number on the package, this checksum is defined as below:

$$\max_{i,j,k} (s_i+s_j) \oplus s_k$$
which $i,j,k$ are three different integers between $1$ and $n$. And $\oplus$ is symbol of bitwise XOR.

Can you help John calculate the checksum number of today?

Input

The first line of input contains an integer $T$ indicating the total number of test cases. The first line of each test case is an integer $n$, indicating the number of chips produced today. The next line has $n$ integers $s_1, s_2, .., s_n$, separated with single space, indicating serial number of each chip. $1 \le T \le 1000$ $3 \le n \le 1000$ $0 \le s_i \le 10^9$ There are at most $10$ testcases with $n > 100$

Output

For each test case, please output an integer indicating the checksum number in a line.

Sample Input

2
3
1 2 3
3
100 200 300

Sample Output

6
400

Source

2015ACM/ICPC亚洲区长春站-重现赛（感谢东北师大）

题意

如题目所说，求解$\max_{i,j,k} (s_i+s_j) \oplus s_k$的值.

解题思路

不知道题目是怎么玩的，直接三个$for$循环就可以通过，尴尬！

代码

时间复杂度：$\color{red}{O(n^3)}$

/*除去冗长的头文件*/
const double PI = 3.1415926535898;
const double eps = 1e-10;
const int MAXM = 1e5 + 5;
const int MAXN = 1e3 + 5;
const int INF = 0x3f3f3f3f;


int T, n;
LL A[MAXN];

int main() {
#ifndef ONLINE_JUDGE
    //FIN;
    //FOUT;
#endif
    IO_Init();
    scanf("%d", &T);
    while(T --) {
        scanf("%d", &n);
        LL Max = 0;
        for(int i = 0; i < n; i ++) {
            scanf("%lld", &A[i]);
        }
        for(int i = 0; i < n; i ++) {
            for(int j = i + 1 ; j < n; j ++) {
                for(int k = j + 1; k < n; k ++) {
                    Max = max(Max, (A[i] + A[j]) ^ A[k]);
                    Max = max(Max, (A[i] + A[k]) ^ A[j]);
                    Max = max(Max, (A[k] + A[j]) ^ A[i]);
                }
            }
        }
        printf("%lld\n", Max);
    }
    return 0;
}