Cod sursa(job #3154877)
| Utilizator | Data | 6 octombrie 2023 17:54:27 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define L 100005
using namespace std;
ifstream fin("xormax.in");
ofstream fout("xormax.out");
int n;
int v[L];
int main(){
fin >> n;
for (int i = 1; i <= n; i++) {
int x;
fin >> x;
v[i] = (v[i - 1] ^ x);
}
int ans = -1, le = -1, ri = -1;
for (int j = 1; j <= n; j++)
for (int i = j - 1; i >= 0; i--)
if (ans < (v[i] ^ v[j])) {
ans = (v[i] ^ v[j]);
le = i + 1;
ri = j;
}
fout << ans << " " << le << " " << ri << "\n";
return 0;
}
