Pagini recente » Cod sursa (job #214286) | Cod sursa (job #217684) | Cod sursa (job #2167570) | Cod sursa (job #2793293) | Cod sursa (job #1783633)
#include <fstream>
using namespace std;
ifstream f("xormax.in");
ofstream g("xormax.out");
int n, a[100005], i, j;
int k, kmax, lmax, rmax;
int main() {
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
for (i = 1; i <= n; i++) {
k = a[i];
for (j = i+1; j <= n; j++) {
k = (k^a[j]);
if (k > kmax) {
kmax = k;
rmax = j, lmax = i;
}
else if (k == kmax && (j-i+1) > rmax-lmax+1)
rmax = j, lmax = i;
}
}
g << kmax << ' ' << lmax << ' ' << rmax;
return 0;
}