Pagini recente » Cod sursa (job #216926) | Cod sursa (job #1711688) | Cod sursa (job #2830482) | Cod sursa (job #104902) | Cod sursa (job #1777078)
#include <cstdio>
#include <vector>
using namespace std;
int arb[1<<22];
int v[100010];
char v1[23];
void add_trie(int x,int poz)
{
int nod=1;
for(int i=0;i<21;i++)
{
arb[nod*2+v1[i]]=poz;
nod=nod*2+v1[i];
}
}
int find_trie(int x)
{
int nod=1;
for(int i=0;i<21;i++)
if(arb[nod*2+1-v1[i]]>0) nod=nod*2+1-v1[i];
else nod=nod*2+v1[i];
return arb[nod];
}
int main()
{
freopen("xormax.in","r",stdin);
freopen("xormax.out","w",stdout);
int n,maxx=-1,i1,j1,poz;
scanf("%d",&n);
for(int i=2;i<=(1<<22);i++) arb[i]=-1;
for(int i=1;i<=22;i++) arb[1<<i]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
v[i]=v[i-1]^v[i];
for(int j=0;j<21;j++)
if(v[i]&(1<<(20-j))) v1[j]=1;
else v1[j]=0;
poz=find_trie(v[i]);
if(v[i]^v[poz]>maxx) {maxx=v[i]^v[poz];i1=poz+1;j1=i;}
add_trie(v[i],i);
}
printf("%d %d %d",maxx,i1,j1);
return 0;
}