HDU - 5536 Chip Factory（暴力）

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 nn chips today, the ii -th chip produced this day has a serial number sisi .

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:

maxi,j,k(si+sj)⊕skmaxi,j,k(si+sj)⊕sk

which i,j,ki,j,k are three different integers between 11 and nn . And ⊕⊕ is symbol of bitwise XOR.

Can you help John calculate the checksum number of today?InputThe first line of input contains an integer TT indicating the total number of test cases.

The first line of each test case is an integer nn , indicating the number of chips produced today. The next line has nn integers s1,s2,..,sns1,s2,..,sn , separated with single space, indicating serial number of each chip.

1≤T≤10001≤T≤1000
3≤n≤10003≤n≤1000
0≤si≤1090≤si≤109
There are at most 1010 testcases with n>100n>100 OutputFor 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
思路：这道题是到暴力题，但是也不能瞎暴力，要注意在n^3复杂度下做些优化，比如有些数值会重复计算，这会导致时间过长。需要在符合i != j && i != k && k != j 情况下，使某个值与后面那些未出现过的值进行运算，这就降低了时间复杂度。

#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;

int t, n, s[1000+8], sum;

int main()
{
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        sum = 0;
        for(int i = 0; i<n; i++)
            scanf("%d", &s[i]);
        for(int i = 0; i<n; i++)
            for(int j = i+1; j<n; j++)
                for(int k = j+1; k<n; k++)
                {
                    int ying = (s[i]+s[j])^s[k];
                    int miao = (s[j]+s[k])^s[i];
                    int wang = (s[i]+s[k])^s[j];
                    if(ying>sum) sum = ying;
                    if(miao>sum) sum = miao;
                    if(wang>sum) sum = wang;
                }
        printf("%d\n", sum);
    }
    return 0;
}

 

 

转载于:https://www.cnblogs.com/RootVount/p/10908141.html