Cod sursa(job #96301)
| Utilizator | Data | 31 octombrie 2007 22:03:05 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<stdio.h>
long long a[100005], n, pi, pf, max, xor1;
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++)
{
xor1=xor1^a[j];
if (xor1>max) {pi=i; pf=j; max=xor1;}
}
}
printf("%lld %lld %lld",max,pi,pf);
return 0;
}
