Cod sursa(job #1706858)
| Utilizator | Data | 23 mai 2016 17:01:32 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, x[100001], xmax, start, stop;
int main()
{
ifstream f("xormax.in");
ofstream g("xormax.out");
int a;
f>>n;
for(int i = 1; i <= n; i++)
{
f >> a;
x[i] = x[i - 1] ^ a;
}
xmax=x[1];
start=1;
stop=1;
for(int k = 2; k <= n; k++)
{
for(int p = k-1; p >=0; p--)
if((x[k]^x[p]) > xmax)
{
xmax = x[k]^x[p];
start = p+1;
stop = k;
}
}
g<<xmax<<' '<<start<<' '<<stop;
f.close();
g.close();
return 0;
}
