Pagini recente » Borderou de evaluare (job #173618) | Cod sursa (job #2606304) | Cod sursa (job #2964623) | Cod sursa (job #225687) | Cod sursa (job #3222773)
#include <fstream>
using namespace std;
ifstream cin("xormax.in");
ofstream cout("xormax.out");
int n,s[100005],trie[4194304],rasp,st,dr;
char c[21];
int main()
{
int i,j,nod,aux;rasp=-1;
cin>>n;
for(i=2;i<4194304;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++) c[j]=(bool)(s[i]&(1<<(20-j)));
nod=1;
for(j=0;j<21;j++){
aux=0;
if(!c[j]) aux=1;
if(trie[(nod<<1)+aux]>0) nod=(nod<<1)+aux;
else nod=(nod<<1)+c[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<<1)+c[j];
trie[nod]=i;
}
}
cout<<rasp<<" "<<st<<" "<<dr<<"\n";
return 0;
}