HDU--6579 Operation （前缀线性基）

HDU–6579 Operation

题面：
There is an integer sequence a of length n and there are two kinds of operations:
0 l r: select some numbers from al…ar so that their xor sum is maximum, and print the maximum value.

1 x: append x to the end of the sequence and let n=n+1.

Input
There are multiple test cases. The first line of input contains an integer T(T≤10), indicating the number of test cases.

For each test case:
The first line contains two integers n,m(1≤n≤5×10⁵,1≤m≤5×10⁵), the number of integers initially in the sequence and the number of operations.

The second line contains n integers a1,a2,…,an(0≤ai<2³⁰), denoting the initial sequence.
Each of the next m lines contains one of the operations given above.

It’s guaranteed that ∑n≤10⁶,∑m≤10⁶,0≤x<2³⁰.

And operations will be encrypted. You need to decode the operations as follows, where lastans denotes the answer to the last type 0 operation and is initially zero:
For every type 0 operation, let l=(l xor lastans)mod n + 1, r=(r xor lastans)mod n + 1, and then swap(l, r) if l>r.
For every type 1 operation, let x=x xor lastans.

Output
For each type 0 operation, please output the maximum xor sum in a single line.

Sample Input
1
3 3
0 1 2
0 1 1
1 3
0 3 4

Sample Output
1
3

题意：
给定一个序列a，有两种操作，查询 al- - -ar 中的数能异或出来的最大值；在序列后面加上一个数，使序列长度加一。

题解：
对所有 i∈(1,n) 维护一个 ( 1 , i ) 的线性基 a [ i ] [ 30 ] ， 类似于前缀和的思想， 同时对每个线性基记录一下它每一位最后被插入的位置 pos [ i ] [ 30 ]（于是线性基的insert函数就要稍微改一下）， 这样在查询(L,R)区间的时候只有a[R]中pos大于等于L的位会对(L,R)区间有贡献。

怎么维护呢？
我们让对 当前 i 的高位产生贡献的数尽量的靠右。

$假设我们现在维护a[i]，先令a[i]=a[i-1]，假设现在插入x，令val=x，pos=i。$

$从高到低考虑val的每一位，若当前位不为0：$
$考虑a[i]的这一位j：$
（