Pagini recente » Cod sursa (job #3143014) | Cod sursa (job #1996399) | Cod sursa (job #1163120) | Cod sursa (job #2344504) | Cod sursa (job #82267)
Cod sursa(job #82267)
#include<stdio.h>
long long a[100005], n, pi, pf, max, xor;
int main()
{
long i, j;
freopen("xormax.in","r",stdin);
freopen("xormax.out","w",stdout);
scanf("%lld",&n);
for (i = 1; i <= n; i++) scanf("%lld",&a[i]);
for (i = 1; i < n; i++)
{
xor=a[i];
for (j = i + 1; j <= n; j++)
{
xor=xor^a[j];
if (xor>max) {pi=i; pf=j; max=xor;}
}
}
printf("%lld %lld %lld",max,pi,pf);
return 0;
}