Pagini recente » Cod sursa (job #526226) | Cod sursa (job #2319742) | Cod sursa (job #973240) | Cod sursa (job #2343857) | Cod sursa (job #138590)
Cod sursa(job #138590)
#include<stdio.h>
FILE *fin=freopen("xormax.in","r",stdin),
*fout=freopen("xormax.out","w",stdout);
int n,a[100001],x[100001];
void citire()
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
}
void solve()
{
x[0]=a[0];
int max=x[0],poz=0;
for(int i=1;i<n;i++)
{
x[i]=((x[i-1]^a[i])>a[i])?x[i-1]^a[i]:a[i];
if(x[i]>max) max=x[i],poz=i;
}
int pom=poz;
while((x[pom-1]^a[pom])==x[pom])
pom--;
printf("%d %d %d",max,pom+1,poz+1);
}
int main()
{
citire();
solve();
return 0;
}