Pagini recente » Cod sursa (job #990578) | Cod sursa (job #181558) | Cod sursa (job #1255227) | Cod sursa (job #2036495) | Cod sursa (job #82273)
Cod sursa(job #82273)
#include<stdio.h>
long long a[200005], n, pi, pf, max, xor1, xor2;
int main()
{
long i, j;
freopen("xormax.in","r",stdin);
freopen("xormax.out","w",stdout);
max=-1;
scanf("%lld",&n);
for (i = 1; i <= n; i++) scanf("%lld",&a[i]);
for (i = 1; i < n; i++)
{
xor1=a[i];
for (j = i + 1; j <= n; j++)
{
xor2=(xor1^a[j]);
if (xor2>max) {pi=i; pf=j; max=xor2;}
xor1=xor2;
}
}
printf("%lld %lld %lld",max,pi,pf);
return 0;
}