Pagini recente » Cod sursa (job #183180) | Cod sursa (job #854317) | Cod sursa (job #581882) | Cod sursa (job #2436458) | Cod sursa (job #2618956)
#define MAX_N 100000
#define XOR(st, dr) (A[(dr)] ^ A[(st) - 1])
#include <fstream>
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
int n, A[MAX_N + 1];
int main()
{
fin >> n;
for (int i = 1, x; i <= n; ++i)
{
fin >> x;
A[i] = x ^ A[i - 1];
}
int I = -1, J = -1, ma = -1;
for (int i = 1; i <= n; ++i)
{
for (int j = i; j <= n; ++j)
{
if (ma < XOR(i, j))
{
ma = XOR(i, j);
I = i;
J = j;
}
}
}
fout << ma << ' ' << I << ' ' << J;
fin.close();
fout.close();
return 0;
}