Cod sursa(job #405470)
Utilizator | Data | 28 februarie 2010 02:15:40 | |
---|---|---|---|
Problema | Xor Max | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
std::ifstream in("xormax.in");
std::ofstream out("xormax.out");
int main ()
{
int a[100002],x[100002],n,i,j,p1,p2,val;
in>>n;
in>>a[0];
x[0]=a[0];
for(i=1;i<n;i++)
{
in>>a[i];
x[i]=x[i-1]^a[i];
}
int max = -9999;
for(i=0;i<n;i++)
for(j=i;j<n;j++)
{
val=x[j]^x[i];
if(val>=max)
{
max=val;
p1=i;
p2=j;
}
}
out<<max<<" "<<p1+2<<" "<<p2+1;
out.close();
return 0;
}