Submission #2134159

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int n, a[100009], s[1048588], p[1048588];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) cin >> a[i + 1], a[i + 1] ^= a[i];
	for (int i = 0; i < 1 << 20; i++) p[i] = -1;
	for (int i = n; i >= 0; i--) s[a[i] + 1]++, p[a[i]] = i;
	for (int i = 0; i < 1 << 20; i++) s[i + 1] += s[i];
	int res = -1, l = -1, r = -1;
	for (int i = 0; i <= n; i++) {
		int val = 0;
		for (int j = 19; j >= 0; j--) {
			if (s[((a[i] ^ val ^ (1 << j)) & ((1 << 20) - (1 << j))) + (1 << j)] - s[(a[i] ^ val ^ (1 << j)) & ((1 << 20) - (1 << j))]) val |= 1 << j;
		}
		if (val > res) {
			res = val;
			l = i;
			r = p[a[i] ^ val];
		}
	}
	if (res == 0) cout << 0 << ' ' << 1 << ' ' << 1 << endl;
	else cout << res << ' ' << l + 1 << ' ' << r << endl;
	return 0;
}

Submission Info

Judge Result