Pagini recente » Cod sursa (job #3201414) | Borderou de evaluare (job #1608525) | Cod sursa (job #436897) | Cod sursa (job #339724) | Cod sursa (job #3345241)
#include <fstream>
using namespace std;
#define int long long
int n,s[100005],trie[4200000];
char ch[21];
ifstream cin("xormax.in");
ofstream cout("xormax.out");
signed main(){
int i,j,nod,rasp=-1,st=0,dr=0;
cin>>n;
for(i=2;i<(1<<22);i++) trie[i]=-1;
for(i=1;i<22;i++) trie[(1<<i)]=0;
for(i=1;i<=n;i++){
cin>>s[i];
s[i]^=s[i-1];
for(j=0;j<21;j++) ch[j]=(bool)(s[i]&(1<<(20-j)));
nod=1;
for(j=0;j<21;j++){
if(trie[2*nod+(1-ch[j])]>0) nod=nod*2+1-ch[j];
else nod=2*nod+ch[j];
}
j=trie[nod];
if((s[i]^s[j])>rasp){
rasp=s[i]^s[j];
st=j+1;
dr=i;
}
nod=1;
for(j=0;j<21;j++){
nod=nod*2+ch[j];
trie[nod]=i;
}
}
cout<<rasp<<" "<<st<<" "<<dr<<"\n";
return 0;
}