|
题目链接：
huangjing
题意：
这个题目的意思是给出0~n的排列，然后找出与这个序列的配对使(a0 ? b0) + (a1 ? b1) +?+ (an ? bn)最大。。
思路：
从大到小遍历每个数，然后找到与这个数二进制位数互补的数，那么他们的抑或值必定是pow（2，n）-1,，肯定是最大的。。。。 题目：
Number Sequence
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 713 Accepted Submission(s): 337
Special Judge
Problem Description There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules:
● a
i ∈ [0,n]
● a
i ≠ a
j( i ≠ j )
For sequence a and sequence b, the integrating degree t is defined as follows(“?” denotes exclusive or):
t = (a
0 ? b
0) + (a
1 ? b
1) +???+ (a
n ? b
n)
(sequence B should also satisfy the rules described above)
Now give you a number n and the sequence a. You should calculate the maximum integrating degree t and print the sequence b.
Input There are multiple test cases. Please process till EOF.
For each case, the first line contains an integer n(1 ≤ n ≤ 10
5), The second line contains a
0,a
1,a
2,...,a
n.
Output For each case, output two lines.The first line contains the maximum integrating degree t. The second line contains n+1 integers b
0,b
1,b
2,...,b
n. There is exactly one space between b
i and b
i+1
(0 ≤ i ≤ n - 1). Don’t ouput any spaces after b
n.
Sample Input
4
2 0 1 4 3
Sample Output
20
1 0 2 3 4
Source 2014 ACM/ICPC Asia Regional Xi'an Online 代码：
#include
#include
#include
#include
#include
|