Pagini recente » Cod sursa (job #627632) | Cod sursa (job #2095284) | Cod sursa (job #2018576) | Cod sursa (job #1925318) | Cod sursa (job #1648431)
/********************
Created by Sburly
********************/
#include <fstream>
using namespace std;
int main()
{
ifstream f("xormax.in");
ofstream g("xormax.out");
long int n;
f >> n;
long int v[n];
long int xr[n];
f >> v[0];
xr[0] = v[0];
for(long int i = 1; i < n; i++)
{
f >> v[i];
xr[i] = xr[i-1] ^ v[i];
}
long int bestXor;
long int b, e;
for(long int i = 0; i < n; i++)
{
long int cxr;
for(long int j = 0; j < i; j++)
{
cxr = xr[i] ^ xr[j];
if(cxr > bestXor)
{
bestXor = cxr;
b = j;
e = i;
}
}
}
g << bestXor << ' ' << b+2 << ' ' << e+1;
return 0;
}