Pagini recente » Cod sursa (job #2606445) | Cod sursa (job #1638102) | Cod sursa (job #733534) | Cod sursa (job #665988) | Cod sursa (job #2026267)
#include <fstream>
using namespace std;
ifstream in("xormax.in");
ofstream out("xormax.out");
const int NMax = 100007;
int n, v[NMax], d[10000][10000], Max = 0, start = 1, End = 1;
int main()
{
in >> n;
for(int i = 1; i <= n; ++i)
{
in >> v[i];
}
d[1][1] = v[1]; Max = v[1];
for(int i = 1; i <= n; ++i)
{
d[1][i] =d[1][i - 1] ^ v[i];
if(Max < d[1][i])
{
Max = d[1][i];
start = 1;
End = i;
}
}
for(int i = 2; i <= n; ++i)
{
for(int j = i; j <= n; ++j)
{
d[i][j] = d[1][j] ^ d[1][i - 1];
if(Max < d[i][j])
{
Max = d[i][j];
start = i;
End = j;
}
}
}
out << Max << "\n" << start << "\n" << End;
}