__似水流年__的博客

There is an integer sequenceaaof lengthnand there are two kinds of operations:0 l r: select some numbers fromal...ar so that their xor sum is maximum, and print the maximum value. 1 x: append...

从左到右一共n个数，数字下标从1到n编号。一共m次询问，每次询问是否能从第L个到第R个数中（包括第L个和第R个数）选出一些数使得他们异或为K。数据量比较大。输入请用挂intread(){ intans=0; charlast='',ch=getchar(); while(ch>='0'&&ch<='9')ans=ans*10+ch...