Pagini recente » Cod sursa (job #626235) | Cod sursa (job #650460) | Cod sursa (job #2694506) | Cod sursa (job #2692970) | Cod sursa (job #1850522)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
int n,s[100005],trie[1<<22],sol=-1,st,en;
char c[21];
int main()
{
int i,j,nod;
fin >> 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)
{
fin >> 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)
{
if(trie[(nod<<1)+!c[j]]>0) nod=(nod<<1)+!c[j];
else nod=(nod<<1)+c[j];
}
j=trie[nod];
if((s[i]^s[j])>sol)
{
sol=s[i]^s[j];
st=j+1;
en=i;
}
nod=1;
for(j=0;j<21;++j) trie[nod=(nod<<1)+c[j]]=i;
}
fout << sol << ' ' << st << ' ' << en << endl;
return 0;
}