sb题。。正的反的建Trie贪心走更新答案即可。
(整天sb题切切人生没希望了)。
AC代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#define N 400005
using namespace std;
int n,tot=1,a[N],f[N],g[N],bin[35],ch[13000005][2];
int read(){
int x=0; char cr=getchar();
while (cr<'0' || cr>'9') cr=getchar();
while (cr>='0' && cr<='9'){ x=x*10+cr-'0'; cr=getchar(); }
return x;
}
void ins(int x){
int now=1,t,i;
for (i=30; i>=0; now=ch[now][t],i--){
t=(x&bin[i])?1:0;
if (!ch[now][t]) ch[now][t]=++tot;
}
}
int qry(int x){
int now=1,sum=0,t,i;
for (i=30; i>=0; now=ch[now][t],i--){
t=(x&bin[i])?0:1;
if (ch[now][t]) sum|=bin[i]; else t^=1;
}
return sum;
}
int main(){
n=read(); int i,now=0;
bin[0]=1; for (i=1; i<=30; i++) bin[i]=bin[i-1]<<1;
ins(0);
for (i=1; i<=n; i++){
a[i]=read(); now^=a[i]; ins(now);
f[i]=max(f[i-1],qry(now));
}
tot=1; memset(ch,0,sizeof(ch));
ins(0); now=0;
for (i=n; i; i--){
now^=a[i]; ins(now);
g[i]=max(g[i+1],qry(now));
}
int ans=0;
for (i=1; i<n; i++) ans=max(ans,f[i]+g[i+1]);
printf("%d\n",ans);
return 0;
}
by lych
2016.5.30